./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -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 34aba2e0444cf7168338399e1c016871ad9a3305ff2dee9e611b86f3cad834b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:19:17,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:19:18,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:19:18,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:19:18,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:19:18,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:19:18,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:19:18,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:19:18,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:19:18,095 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:19:18,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:19:18,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:19:18,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:19:18,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:19:18,099 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:19:18,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:19:18,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:19:18,100 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:19:18,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:19:18,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:19:18,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:19:18,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:19:18,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:19:18,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:19:18,104 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:19:18,105 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:19:18,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:19:18,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:19:18,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:19:18,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:19:18,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:19:18,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:19:18,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:19:18,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:19:18,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:19:18,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:19:18,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:19:18,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:19:18,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:19:18,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:19:18,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:19:18,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:19:18,110 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 -> 34aba2e0444cf7168338399e1c016871ad9a3305ff2dee9e611b86f3cad834b5 [2024-10-12 20:19:18,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:19:18,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:19:18,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:19:18,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:19:18,402 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:19:18,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-12 20:19:19,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:19:20,201 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:19:20,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-12 20:19:20,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945b7406a/47df9251f51145e9ad2b05de4e01fec2/FLAG533ec3760 [2024-10-12 20:19:20,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945b7406a/47df9251f51145e9ad2b05de4e01fec2 [2024-10-12 20:19:20,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:19:20,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:19:20,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:19:20,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:19:20,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:19:20,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:19:20" (1/1) ... [2024-10-12 20:19:20,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed7ca03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:20, skipping insertion in model container [2024-10-12 20:19:20,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:19:20" (1/1) ... [2024-10-12 20:19:20,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:19:20,607 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8127,8140] [2024-10-12 20:19:20,663 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14997,15010] [2024-10-12 20:19:20,684 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17084,17097] [2024-10-12 20:19:20,691 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18108,18121] [2024-10-12 20:19:20,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:19:20,851 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:19:20,903 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8127,8140] [2024-10-12 20:19:20,922 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14997,15010] [2024-10-12 20:19:20,927 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17084,17097] [2024-10-12 20:19:20,931 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18108,18121] [2024-10-12 20:19:21,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:19:21,086 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:19:21,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:21 WrapperNode [2024-10-12 20:19:21,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:19:21,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:19:21,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:19:21,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:19:21,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:21" (1/1) ... [2024-10-12 20:19:21,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:21" (1/1) ... [2024-10-12 20:19:21,219 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2620 [2024-10-12 20:19:21,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:19:21,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:19:21,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:19:21,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:19:21,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:21" (1/1) ... [2024-10-12 20:19:21,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:21" (1/1) ... [2024-10-12 20:19:21,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:21" (1/1) ... [2024-10-12 20:19:21,290 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:19:21,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:21" (1/1) ... [2024-10-12 20:19:21,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:21" (1/1) ... [2024-10-12 20:19:21,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:21" (1/1) ... [2024-10-12 20:19:21,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:21" (1/1) ... [2024-10-12 20:19:21,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:21" (1/1) ... [2024-10-12 20:19:21,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:21" (1/1) ... [2024-10-12 20:19:21,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:19:21,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:19:21,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:19:21,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:19:21,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:21" (1/1) ... [2024-10-12 20:19:21,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:19:21,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:21,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:19:21,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:19:21,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:19:21,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:19:21,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:19:21,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:19:21,651 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:19:21,654 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:19:22,992 INFO L? ?]: Removed 426 outVars from TransFormulas that were not future-live. [2024-10-12 20:19:22,993 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:19:23,055 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:19:23,059 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:19:23,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:19:23 BoogieIcfgContainer [2024-10-12 20:19:23,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:19:23,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:19:23,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:19:23,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:19:23,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:19:20" (1/3) ... [2024-10-12 20:19:23,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29dc0945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:19:23, skipping insertion in model container [2024-10-12 20:19:23,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:21" (2/3) ... [2024-10-12 20:19:23,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29dc0945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:19:23, skipping insertion in model container [2024-10-12 20:19:23,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:19:23" (3/3) ... [2024-10-12 20:19:23,071 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-12 20:19:23,088 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:19:23,088 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-12 20:19:23,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:19:23,179 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;@55caf3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:19:23,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-12 20:19:23,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 454 states, 449 states have (on average 1.8530066815144766) internal successors, (832), 453 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:23,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:19:23,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:23,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:23,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:23,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash 34120099, now seen corresponding path program 1 times [2024-10-12 20:19:23,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:23,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545729202] [2024-10-12 20:19:23,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:23,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:23,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:23,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545729202] [2024-10-12 20:19:23,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545729202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:23,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:23,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:23,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576914482] [2024-10-12 20:19:23,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:23,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:23,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:23,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:23,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:23,857 INFO L87 Difference]: Start difference. First operand has 454 states, 449 states have (on average 1.8530066815144766) internal successors, (832), 453 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:24,395 INFO L93 Difference]: Finished difference Result 796 states and 1404 transitions. [2024-10-12 20:19:24,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:24,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-12 20:19:24,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:24,412 INFO L225 Difference]: With dead ends: 796 [2024-10-12 20:19:24,412 INFO L226 Difference]: Without dead ends: 505 [2024-10-12 20:19:24,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:24,419 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 2411 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2411 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:24,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2411 Valid, 614 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:19:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-10-12 20:19:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 499. [2024-10-12 20:19:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 495 states have (on average 1.3636363636363635) internal successors, (675), 498 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 675 transitions. [2024-10-12 20:19:24,489 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 675 transitions. Word has length 49 [2024-10-12 20:19:24,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:24,489 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 675 transitions. [2024-10-12 20:19:24,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 675 transitions. [2024-10-12 20:19:24,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:19:24,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:24,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:24,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:19:24,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:24,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash 758566708, now seen corresponding path program 1 times [2024-10-12 20:19:24,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:24,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818934768] [2024-10-12 20:19:24,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:24,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:24,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:24,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818934768] [2024-10-12 20:19:24,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818934768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:24,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:24,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:24,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725216695] [2024-10-12 20:19:24,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:24,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:24,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:24,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:24,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:24,617 INFO L87 Difference]: Start difference. First operand 499 states and 675 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:24,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:24,657 INFO L93 Difference]: Finished difference Result 817 states and 1148 transitions. [2024-10-12 20:19:24,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:24,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-12 20:19:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:24,660 INFO L225 Difference]: With dead ends: 817 [2024-10-12 20:19:24,660 INFO L226 Difference]: Without dead ends: 610 [2024-10-12 20:19:24,661 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-10-12 20:19:24,663 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 323 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:24,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 869 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:24,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-10-12 20:19:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 603. [2024-10-12 20:19:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 599 states have (on average 1.3823038397328882) internal successors, (828), 602 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 828 transitions. [2024-10-12 20:19:24,692 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 828 transitions. Word has length 49 [2024-10-12 20:19:24,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:24,693 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 828 transitions. [2024-10-12 20:19:24,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 828 transitions. [2024-10-12 20:19:24,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:19:24,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:24,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:24,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:19:24,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:24,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:24,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1943064238, now seen corresponding path program 1 times [2024-10-12 20:19:24,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:24,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940784263] [2024-10-12 20:19:24,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:24,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:24,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:24,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940784263] [2024-10-12 20:19:24,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940784263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:24,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:24,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:24,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271676465] [2024-10-12 20:19:24,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:24,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:24,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:24,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:24,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:24,837 INFO L87 Difference]: Start difference. First operand 603 states and 828 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:24,912 INFO L93 Difference]: Finished difference Result 1204 states and 1718 transitions. [2024-10-12 20:19:24,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:24,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-12 20:19:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:24,918 INFO L225 Difference]: With dead ends: 1204 [2024-10-12 20:19:24,919 INFO L226 Difference]: Without dead ends: 899 [2024-10-12 20:19:24,920 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-10-12 20:19:24,921 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 279 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:24,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 902 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2024-10-12 20:19:24,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 892. [2024-10-12 20:19:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 888 states have (on average 1.4065315315315314) internal successors, (1249), 891 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1249 transitions. [2024-10-12 20:19:24,953 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1249 transitions. Word has length 49 [2024-10-12 20:19:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:24,954 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1249 transitions. [2024-10-12 20:19:24,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:24,954 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1249 transitions. [2024-10-12 20:19:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:19:24,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:24,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:24,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:19:24,957 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:24,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:24,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1798780356, now seen corresponding path program 1 times [2024-10-12 20:19:24,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:24,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91576401] [2024-10-12 20:19:24,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:24,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:25,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:25,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91576401] [2024-10-12 20:19:25,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91576401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:25,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:25,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:25,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664410671] [2024-10-12 20:19:25,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:25,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:25,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:25,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:25,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:25,127 INFO L87 Difference]: Start difference. First operand 892 states and 1249 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:25,447 INFO L93 Difference]: Finished difference Result 2159 states and 3108 transitions. [2024-10-12 20:19:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:25,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-12 20:19:25,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:25,455 INFO L225 Difference]: With dead ends: 2159 [2024-10-12 20:19:25,455 INFO L226 Difference]: Without dead ends: 1362 [2024-10-12 20:19:25,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:25,458 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 1589 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:25,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 362 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2024-10-12 20:19:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1356. [2024-10-12 20:19:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1352 states have (on average 1.4363905325443787) internal successors, (1942), 1355 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1942 transitions. [2024-10-12 20:19:25,490 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1942 transitions. Word has length 49 [2024-10-12 20:19:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:25,491 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1942 transitions. [2024-10-12 20:19:25,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1942 transitions. [2024-10-12 20:19:25,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 20:19:25,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:25,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:25,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:19:25,494 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:25,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash -108782984, now seen corresponding path program 1 times [2024-10-12 20:19:25,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:25,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321258744] [2024-10-12 20:19:25,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:25,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:25,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:25,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321258744] [2024-10-12 20:19:25,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321258744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:25,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:25,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:25,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033478374] [2024-10-12 20:19:25,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:25,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:25,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:25,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:25,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:25,576 INFO L87 Difference]: Start difference. First operand 1356 states and 1942 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:25,628 INFO L93 Difference]: Finished difference Result 3415 states and 4939 transitions. [2024-10-12 20:19:25,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:25,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-12 20:19:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:25,638 INFO L225 Difference]: With dead ends: 3415 [2024-10-12 20:19:25,638 INFO L226 Difference]: Without dead ends: 2243 [2024-10-12 20:19:25,641 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-10-12 20:19:25,642 INFO L432 NwaCegarLoop]: 518 mSDtfsCounter, 313 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:25,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 828 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:25,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2024-10-12 20:19:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2225. [2024-10-12 20:19:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 2221 states have (on average 1.4187303016659163) internal successors, (3151), 2224 states have internal predecessors, (3151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:25,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 3151 transitions. [2024-10-12 20:19:25,721 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 3151 transitions. Word has length 50 [2024-10-12 20:19:25,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:25,721 INFO L471 AbstractCegarLoop]: Abstraction has 2225 states and 3151 transitions. [2024-10-12 20:19:25,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 3151 transitions. [2024-10-12 20:19:25,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 20:19:25,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:25,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:25,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:19:25,726 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:25,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:25,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1856759737, now seen corresponding path program 1 times [2024-10-12 20:19:25,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:25,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830941109] [2024-10-12 20:19:25,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:25,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:25,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:25,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830941109] [2024-10-12 20:19:25,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830941109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:25,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:25,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:25,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852191692] [2024-10-12 20:19:25,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:25,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:25,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:25,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:25,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:25,927 INFO L87 Difference]: Start difference. First operand 2225 states and 3151 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:26,258 INFO L93 Difference]: Finished difference Result 5038 states and 7184 transitions. [2024-10-12 20:19:26,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:26,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-12 20:19:26,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:26,270 INFO L225 Difference]: With dead ends: 5038 [2024-10-12 20:19:26,270 INFO L226 Difference]: Without dead ends: 2983 [2024-10-12 20:19:26,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:26,277 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 1392 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:26,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 338 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2024-10-12 20:19:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2964. [2024-10-12 20:19:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2964 states, 2960 states have (on average 1.414864864864865) internal successors, (4188), 2963 states have internal predecessors, (4188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 4188 transitions. [2024-10-12 20:19:26,339 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 4188 transitions. Word has length 51 [2024-10-12 20:19:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:26,341 INFO L471 AbstractCegarLoop]: Abstraction has 2964 states and 4188 transitions. [2024-10-12 20:19:26,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 4188 transitions. [2024-10-12 20:19:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:19:26,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:26,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:26,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:19:26,344 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:26,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1124331061, now seen corresponding path program 1 times [2024-10-12 20:19:26,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:26,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436037577] [2024-10-12 20:19:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:26,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:26,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:26,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436037577] [2024-10-12 20:19:26,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436037577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:26,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:26,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:19:26,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104449710] [2024-10-12 20:19:26,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:26,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:19:26,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:26,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:19:26,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:26,562 INFO L87 Difference]: Start difference. First operand 2964 states and 4188 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:27,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:27,017 INFO L93 Difference]: Finished difference Result 5847 states and 8346 transitions. [2024-10-12 20:19:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:19:27,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-12 20:19:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:27,033 INFO L225 Difference]: With dead ends: 5847 [2024-10-12 20:19:27,033 INFO L226 Difference]: Without dead ends: 4544 [2024-10-12 20:19:27,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:19:27,036 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1723 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1723 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:27,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1723 Valid, 586 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4544 states. [2024-10-12 20:19:27,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4544 to 2978. [2024-10-12 20:19:27,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2978 states, 2974 states have (on average 1.414256893073302) internal successors, (4206), 2977 states have internal predecessors, (4206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2978 states to 2978 states and 4206 transitions. [2024-10-12 20:19:27,135 INFO L78 Accepts]: Start accepts. Automaton has 2978 states and 4206 transitions. Word has length 52 [2024-10-12 20:19:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:27,135 INFO L471 AbstractCegarLoop]: Abstraction has 2978 states and 4206 transitions. [2024-10-12 20:19:27,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2978 states and 4206 transitions. [2024-10-12 20:19:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:19:27,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:27,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:27,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:19:27,139 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:27,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:27,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1221262858, now seen corresponding path program 1 times [2024-10-12 20:19:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:27,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435490749] [2024-10-12 20:19:27,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:27,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:27,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:27,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435490749] [2024-10-12 20:19:27,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435490749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:27,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:27,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:19:27,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774947013] [2024-10-12 20:19:27,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:27,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:19:27,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:27,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:19:27,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:27,302 INFO L87 Difference]: Start difference. First operand 2978 states and 4206 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:27,759 INFO L93 Difference]: Finished difference Result 6530 states and 9327 transitions. [2024-10-12 20:19:27,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:19:27,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-12 20:19:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:27,778 INFO L225 Difference]: With dead ends: 6530 [2024-10-12 20:19:27,778 INFO L226 Difference]: Without dead ends: 5418 [2024-10-12 20:19:27,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:19:27,783 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 1848 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1848 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:27,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1848 Valid, 621 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:19:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5418 states. [2024-10-12 20:19:27,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5418 to 3000. [2024-10-12 20:19:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3000 states, 2996 states have (on average 1.414218958611482) internal successors, (4237), 2999 states have internal predecessors, (4237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 4237 transitions. [2024-10-12 20:19:27,872 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 4237 transitions. Word has length 52 [2024-10-12 20:19:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:27,873 INFO L471 AbstractCegarLoop]: Abstraction has 3000 states and 4237 transitions. [2024-10-12 20:19:27,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 4237 transitions. [2024-10-12 20:19:27,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:19:27,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:27,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:27,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:19:27,877 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:27,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash -163415276, now seen corresponding path program 1 times [2024-10-12 20:19:27,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:27,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359307882] [2024-10-12 20:19:27,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:27,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:28,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:28,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359307882] [2024-10-12 20:19:28,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359307882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:28,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:28,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:19:28,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681112316] [2024-10-12 20:19:28,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:28,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:19:28,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:28,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:19:28,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:28,038 INFO L87 Difference]: Start difference. First operand 3000 states and 4237 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:28,490 INFO L93 Difference]: Finished difference Result 7210 states and 10288 transitions. [2024-10-12 20:19:28,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:19:28,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-12 20:19:28,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:28,511 INFO L225 Difference]: With dead ends: 7210 [2024-10-12 20:19:28,512 INFO L226 Difference]: Without dead ends: 6242 [2024-10-12 20:19:28,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:19:28,518 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 1962 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:28,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 633 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:19:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6242 states. [2024-10-12 20:19:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6242 to 3034. [2024-10-12 20:19:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 3030 states have (on average 1.4128712871287128) internal successors, (4281), 3033 states have internal predecessors, (4281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 4281 transitions. [2024-10-12 20:19:28,602 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 4281 transitions. Word has length 52 [2024-10-12 20:19:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:28,602 INFO L471 AbstractCegarLoop]: Abstraction has 3034 states and 4281 transitions. [2024-10-12 20:19:28,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 4281 transitions. [2024-10-12 20:19:28,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:19:28,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:28,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:28,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:19:28,605 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:28,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:28,606 INFO L85 PathProgramCache]: Analyzing trace with hash -55106621, now seen corresponding path program 1 times [2024-10-12 20:19:28,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:28,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860843219] [2024-10-12 20:19:28,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:28,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:28,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:28,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860843219] [2024-10-12 20:19:28,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860843219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:28,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:28,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:19:28,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208938572] [2024-10-12 20:19:28,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:28,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:19:28,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:28,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:19:28,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:28,923 INFO L87 Difference]: Start difference. First operand 3034 states and 4281 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:29,421 INFO L93 Difference]: Finished difference Result 6200 states and 8912 transitions. [2024-10-12 20:19:29,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:19:29,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-12 20:19:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:29,435 INFO L225 Difference]: With dead ends: 6200 [2024-10-12 20:19:29,435 INFO L226 Difference]: Without dead ends: 4251 [2024-10-12 20:19:29,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:19:29,439 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 1446 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:29,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 774 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:19:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4251 states. [2024-10-12 20:19:29,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4251 to 2944. [2024-10-12 20:19:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2944 states, 2940 states have (on average 1.4125850340136055) internal successors, (4153), 2943 states have internal predecessors, (4153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 4153 transitions. [2024-10-12 20:19:29,488 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 4153 transitions. Word has length 53 [2024-10-12 20:19:29,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:29,489 INFO L471 AbstractCegarLoop]: Abstraction has 2944 states and 4153 transitions. [2024-10-12 20:19:29,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 4153 transitions. [2024-10-12 20:19:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:19:29,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:29,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:29,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:19:29,492 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:29,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:29,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1129390909, now seen corresponding path program 1 times [2024-10-12 20:19:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116033825] [2024-10-12 20:19:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:29,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116033825] [2024-10-12 20:19:29,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116033825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:29,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:29,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:19:29,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188210948] [2024-10-12 20:19:29,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:29,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:19:29,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:29,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:19:29,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:19:29,731 INFO L87 Difference]: Start difference. First operand 2944 states and 4153 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:30,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:30,373 INFO L93 Difference]: Finished difference Result 5898 states and 8420 transitions. [2024-10-12 20:19:30,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:19:30,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-12 20:19:30,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:30,380 INFO L225 Difference]: With dead ends: 5898 [2024-10-12 20:19:30,381 INFO L226 Difference]: Without dead ends: 4109 [2024-10-12 20:19:30,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:19:30,385 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1535 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1535 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:30,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1535 Valid, 963 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:19:30,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2024-10-12 20:19:30,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 2915. [2024-10-12 20:19:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2915 states, 2911 states have (on average 1.4125729989694262) internal successors, (4112), 2914 states have internal predecessors, (4112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 4112 transitions. [2024-10-12 20:19:30,430 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 4112 transitions. Word has length 53 [2024-10-12 20:19:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:30,431 INFO L471 AbstractCegarLoop]: Abstraction has 2915 states and 4112 transitions. [2024-10-12 20:19:30,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 4112 transitions. [2024-10-12 20:19:30,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:19:30,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:30,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:30,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:19:30,433 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:30,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:30,434 INFO L85 PathProgramCache]: Analyzing trace with hash -421230622, now seen corresponding path program 1 times [2024-10-12 20:19:30,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:30,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534941934] [2024-10-12 20:19:30,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:30,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:30,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:30,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:30,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534941934] [2024-10-12 20:19:30,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534941934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:30,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:30,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:19:30,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567197386] [2024-10-12 20:19:30,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:30,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:19:30,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:30,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:19:30,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:19:30,688 INFO L87 Difference]: Start difference. First operand 2915 states and 4112 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:31,280 INFO L93 Difference]: Finished difference Result 4376 states and 6196 transitions. [2024-10-12 20:19:31,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:19:31,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-12 20:19:31,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:31,288 INFO L225 Difference]: With dead ends: 4376 [2024-10-12 20:19:31,288 INFO L226 Difference]: Without dead ends: 4371 [2024-10-12 20:19:31,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:19:31,290 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 1518 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:31,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1077 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:19:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2024-10-12 20:19:31,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 2915. [2024-10-12 20:19:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2915 states, 2911 states have (on average 1.411885949845414) internal successors, (4110), 2914 states have internal predecessors, (4110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 4110 transitions. [2024-10-12 20:19:31,337 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 4110 transitions. Word has length 53 [2024-10-12 20:19:31,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:31,337 INFO L471 AbstractCegarLoop]: Abstraction has 2915 states and 4110 transitions. [2024-10-12 20:19:31,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 4110 transitions. [2024-10-12 20:19:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:19:31,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:31,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:31,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:19:31,340 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:31,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1237294753, now seen corresponding path program 1 times [2024-10-12 20:19:31,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:31,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054488585] [2024-10-12 20:19:31,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:31,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:31,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:31,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054488585] [2024-10-12 20:19:31,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054488585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:31,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:31,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:31,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39075399] [2024-10-12 20:19:31,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:31,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:31,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:31,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:31,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:31,397 INFO L87 Difference]: Start difference. First operand 2915 states and 4110 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:31,442 INFO L93 Difference]: Finished difference Result 4185 states and 5951 transitions. [2024-10-12 20:19:31,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:31,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-12 20:19:31,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:31,447 INFO L225 Difference]: With dead ends: 4185 [2024-10-12 20:19:31,447 INFO L226 Difference]: Without dead ends: 2922 [2024-10-12 20:19:31,449 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-10-12 20:19:31,450 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 226 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:31,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 802 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:31,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2024-10-12 20:19:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2915. [2024-10-12 20:19:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2915 states, 2911 states have (on average 1.3981449673651667) internal successors, (4070), 2914 states have internal predecessors, (4070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 4070 transitions. [2024-10-12 20:19:31,486 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 4070 transitions. Word has length 54 [2024-10-12 20:19:31,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:31,487 INFO L471 AbstractCegarLoop]: Abstraction has 2915 states and 4070 transitions. [2024-10-12 20:19:31,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 4070 transitions. [2024-10-12 20:19:31,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:19:31,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:31,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:31,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:19:31,490 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:31,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:31,491 INFO L85 PathProgramCache]: Analyzing trace with hash -863697757, now seen corresponding path program 1 times [2024-10-12 20:19:31,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:31,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476298868] [2024-10-12 20:19:31,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:31,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:31,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:31,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476298868] [2024-10-12 20:19:31,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476298868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:31,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:31,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:31,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280087621] [2024-10-12 20:19:31,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:31,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:31,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:31,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:31,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:31,557 INFO L87 Difference]: Start difference. First operand 2915 states and 4070 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:31,588 INFO L93 Difference]: Finished difference Result 4254 states and 5987 transitions. [2024-10-12 20:19:31,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:31,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-12 20:19:31,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:31,593 INFO L225 Difference]: With dead ends: 4254 [2024-10-12 20:19:31,594 INFO L226 Difference]: Without dead ends: 2921 [2024-10-12 20:19:31,595 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-10-12 20:19:31,596 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 242 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:31,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 803 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2024-10-12 20:19:31,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2915. [2024-10-12 20:19:31,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2915 states, 2911 states have (on average 1.385778083132944) internal successors, (4034), 2914 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 4034 transitions. [2024-10-12 20:19:31,634 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 4034 transitions. Word has length 54 [2024-10-12 20:19:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:31,634 INFO L471 AbstractCegarLoop]: Abstraction has 2915 states and 4034 transitions. [2024-10-12 20:19:31,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 4034 transitions. [2024-10-12 20:19:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:19:31,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:31,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:31,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:19:31,638 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:31,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:31,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1589153365, now seen corresponding path program 1 times [2024-10-12 20:19:31,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:31,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448791595] [2024-10-12 20:19:31,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:31,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:31,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:31,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448791595] [2024-10-12 20:19:31,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448791595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:31,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:31,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:31,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64623803] [2024-10-12 20:19:31,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:31,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:31,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:31,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:31,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:31,698 INFO L87 Difference]: Start difference. First operand 2915 states and 4034 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:31,730 INFO L93 Difference]: Finished difference Result 3996 states and 5540 transitions. [2024-10-12 20:19:31,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:31,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-12 20:19:31,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:31,735 INFO L225 Difference]: With dead ends: 3996 [2024-10-12 20:19:31,735 INFO L226 Difference]: Without dead ends: 2906 [2024-10-12 20:19:31,737 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-10-12 20:19:31,738 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 261 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:31,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 814 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:31,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2024-10-12 20:19:31,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 2900. [2024-10-12 20:19:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2896 states have (on average 1.3584254143646408) internal successors, (3934), 2899 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3934 transitions. [2024-10-12 20:19:31,793 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3934 transitions. Word has length 54 [2024-10-12 20:19:31,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:31,793 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 3934 transitions. [2024-10-12 20:19:31,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3934 transitions. [2024-10-12 20:19:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:19:31,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:31,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:31,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:19:31,797 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:31,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1127796312, now seen corresponding path program 1 times [2024-10-12 20:19:31,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:31,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956982704] [2024-10-12 20:19:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:31,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:31,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956982704] [2024-10-12 20:19:31,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956982704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:31,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:31,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:31,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550355756] [2024-10-12 20:19:31,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:31,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:31,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:31,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:31,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:31,850 INFO L87 Difference]: Start difference. First operand 2900 states and 3934 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:31,916 INFO L93 Difference]: Finished difference Result 4575 states and 6263 transitions. [2024-10-12 20:19:31,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:31,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-12 20:19:31,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:31,923 INFO L225 Difference]: With dead ends: 4575 [2024-10-12 20:19:31,923 INFO L226 Difference]: Without dead ends: 3318 [2024-10-12 20:19:31,925 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-10-12 20:19:31,925 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 326 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:31,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 522 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:31,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3318 states. [2024-10-12 20:19:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3318 to 2718. [2024-10-12 20:19:31,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2718 states, 2714 states have (on average 1.3625644804716286) internal successors, (3698), 2717 states have internal predecessors, (3698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 3698 transitions. [2024-10-12 20:19:31,960 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 3698 transitions. Word has length 55 [2024-10-12 20:19:31,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:31,961 INFO L471 AbstractCegarLoop]: Abstraction has 2718 states and 3698 transitions. [2024-10-12 20:19:31,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 3698 transitions. [2024-10-12 20:19:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 20:19:31,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:31,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:31,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:19:31,964 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:31,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:31,964 INFO L85 PathProgramCache]: Analyzing trace with hash 847139516, now seen corresponding path program 1 times [2024-10-12 20:19:31,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:31,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991200175] [2024-10-12 20:19:31,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:31,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:32,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:32,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991200175] [2024-10-12 20:19:32,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991200175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:32,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:32,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:32,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403945091] [2024-10-12 20:19:32,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:32,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:32,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:32,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:32,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:32,025 INFO L87 Difference]: Start difference. First operand 2718 states and 3698 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:32,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:32,106 INFO L93 Difference]: Finished difference Result 4994 states and 6853 transitions. [2024-10-12 20:19:32,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:32,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-12 20:19:32,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:32,112 INFO L225 Difference]: With dead ends: 4994 [2024-10-12 20:19:32,112 INFO L226 Difference]: Without dead ends: 3333 [2024-10-12 20:19:32,114 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-10-12 20:19:32,115 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 302 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:32,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 460 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2024-10-12 20:19:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 2582. [2024-10-12 20:19:32,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2582 states, 2578 states have (on average 1.3661753297129557) internal successors, (3522), 2581 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 3522 transitions. [2024-10-12 20:19:32,150 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 3522 transitions. Word has length 56 [2024-10-12 20:19:32,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:32,150 INFO L471 AbstractCegarLoop]: Abstraction has 2582 states and 3522 transitions. [2024-10-12 20:19:32,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 3522 transitions. [2024-10-12 20:19:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 20:19:32,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:32,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:32,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:19:32,154 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:32,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash 474120695, now seen corresponding path program 1 times [2024-10-12 20:19:32,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:32,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340488856] [2024-10-12 20:19:32,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:32,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:32,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:32,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340488856] [2024-10-12 20:19:32,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340488856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:32,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:32,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:19:32,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931318265] [2024-10-12 20:19:32,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:32,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:19:32,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:32,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:19:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:19:32,802 INFO L87 Difference]: Start difference. First operand 2582 states and 3522 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:33,424 INFO L93 Difference]: Finished difference Result 3778 states and 5197 transitions. [2024-10-12 20:19:33,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:19:33,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-12 20:19:33,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:33,430 INFO L225 Difference]: With dead ends: 3778 [2024-10-12 20:19:33,431 INFO L226 Difference]: Without dead ends: 3774 [2024-10-12 20:19:33,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:19:33,432 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 2060 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2060 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:33,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2060 Valid, 1526 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:33,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3774 states. [2024-10-12 20:19:33,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 2578. [2024-10-12 20:19:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 2575 states have (on average 1.3658252427184465) internal successors, (3517), 2577 states have internal predecessors, (3517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3517 transitions. [2024-10-12 20:19:33,468 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3517 transitions. Word has length 56 [2024-10-12 20:19:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:33,468 INFO L471 AbstractCegarLoop]: Abstraction has 2578 states and 3517 transitions. [2024-10-12 20:19:33,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3517 transitions. [2024-10-12 20:19:33,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 20:19:33,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:33,470 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:33,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:19:33,471 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:33,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:33,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1321631968, now seen corresponding path program 1 times [2024-10-12 20:19:33,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:33,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433774820] [2024-10-12 20:19:33,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:33,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:33,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:33,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:33,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433774820] [2024-10-12 20:19:33,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433774820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:33,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:33,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:19:33,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530680175] [2024-10-12 20:19:33,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:33,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:19:33,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:33,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:19:33,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:19:33,992 INFO L87 Difference]: Start difference. First operand 2578 states and 3517 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:34,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:34,600 INFO L93 Difference]: Finished difference Result 3353 states and 4601 transitions. [2024-10-12 20:19:34,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:19:34,601 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-12 20:19:34,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:34,607 INFO L225 Difference]: With dead ends: 3353 [2024-10-12 20:19:34,607 INFO L226 Difference]: Without dead ends: 3245 [2024-10-12 20:19:34,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:19:34,609 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 2017 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:34,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 1649 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2024-10-12 20:19:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 2566. [2024-10-12 20:19:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2564 states have (on average 1.3662246489859595) internal successors, (3503), 2565 states have internal predecessors, (3503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3503 transitions. [2024-10-12 20:19:34,639 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3503 transitions. Word has length 56 [2024-10-12 20:19:34,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:34,640 INFO L471 AbstractCegarLoop]: Abstraction has 2566 states and 3503 transitions. [2024-10-12 20:19:34,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3503 transitions. [2024-10-12 20:19:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 20:19:34,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:34,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:34,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:19:34,643 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:34,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:34,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1858163223, now seen corresponding path program 1 times [2024-10-12 20:19:34,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:34,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879160896] [2024-10-12 20:19:34,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:34,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:35,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:35,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879160896] [2024-10-12 20:19:35,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879160896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:35,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:35,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:19:35,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352689262] [2024-10-12 20:19:35,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:35,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:19:35,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:35,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:19:35,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:19:35,106 INFO L87 Difference]: Start difference. First operand 2566 states and 3503 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:35,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:35,726 INFO L93 Difference]: Finished difference Result 3762 states and 5178 transitions. [2024-10-12 20:19:35,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:19:35,727 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-12 20:19:35,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:35,734 INFO L225 Difference]: With dead ends: 3762 [2024-10-12 20:19:35,734 INFO L226 Difference]: Without dead ends: 3758 [2024-10-12 20:19:35,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:19:35,736 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 1689 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:35,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 1719 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:35,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2024-10-12 20:19:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 2566. [2024-10-12 20:19:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2564 states have (on average 1.3658346333853355) internal successors, (3502), 2565 states have internal predecessors, (3502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3502 transitions. [2024-10-12 20:19:35,777 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3502 transitions. Word has length 56 [2024-10-12 20:19:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:35,777 INFO L471 AbstractCegarLoop]: Abstraction has 2566 states and 3502 transitions. [2024-10-12 20:19:35,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3502 transitions. [2024-10-12 20:19:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 20:19:35,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:35,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:35,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:19:35,780 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:35,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:35,780 INFO L85 PathProgramCache]: Analyzing trace with hash -612654208, now seen corresponding path program 1 times [2024-10-12 20:19:35,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:35,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619665778] [2024-10-12 20:19:35,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:35,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:35,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:35,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619665778] [2024-10-12 20:19:35,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619665778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:35,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:35,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:35,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95404420] [2024-10-12 20:19:35,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:35,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:35,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:35,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:35,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:35,825 INFO L87 Difference]: Start difference. First operand 2566 states and 3502 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:35,878 INFO L93 Difference]: Finished difference Result 4736 states and 6522 transitions. [2024-10-12 20:19:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:35,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-12 20:19:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:35,884 INFO L225 Difference]: With dead ends: 4736 [2024-10-12 20:19:35,884 INFO L226 Difference]: Without dead ends: 3157 [2024-10-12 20:19:35,886 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-10-12 20:19:35,887 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 254 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:35,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 444 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3157 states. [2024-10-12 20:19:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3157 to 2470. [2024-10-12 20:19:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2470 states, 2469 states have (on average 1.3665451599837992) internal successors, (3374), 2469 states have internal predecessors, (3374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 3374 transitions. [2024-10-12 20:19:35,917 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 3374 transitions. Word has length 56 [2024-10-12 20:19:35,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:35,918 INFO L471 AbstractCegarLoop]: Abstraction has 2470 states and 3374 transitions. [2024-10-12 20:19:35,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:35,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3374 transitions. [2024-10-12 20:19:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 20:19:35,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:35,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:35,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:19:35,921 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:35,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:35,922 INFO L85 PathProgramCache]: Analyzing trace with hash 35485201, now seen corresponding path program 1 times [2024-10-12 20:19:35,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:35,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296075995] [2024-10-12 20:19:35,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:35,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:36,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:36,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296075995] [2024-10-12 20:19:36,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296075995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:36,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:36,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:36,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657195324] [2024-10-12 20:19:36,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:36,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:36,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:36,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:36,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:36,006 INFO L87 Difference]: Start difference. First operand 2470 states and 3374 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:36,077 INFO L93 Difference]: Finished difference Result 6002 states and 8417 transitions. [2024-10-12 20:19:36,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:36,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-12 20:19:36,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:36,083 INFO L225 Difference]: With dead ends: 6002 [2024-10-12 20:19:36,084 INFO L226 Difference]: Without dead ends: 4539 [2024-10-12 20:19:36,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:36,086 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 989 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:36,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 776 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4539 states. [2024-10-12 20:19:36,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4539 to 3842. [2024-10-12 20:19:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3842 states, 3841 states have (on average 1.3702160895600104) internal successors, (5263), 3841 states have internal predecessors, (5263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3842 states to 3842 states and 5263 transitions. [2024-10-12 20:19:36,146 INFO L78 Accepts]: Start accepts. Automaton has 3842 states and 5263 transitions. Word has length 65 [2024-10-12 20:19:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:36,147 INFO L471 AbstractCegarLoop]: Abstraction has 3842 states and 5263 transitions. [2024-10-12 20:19:36,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:36,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3842 states and 5263 transitions. [2024-10-12 20:19:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 20:19:36,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:36,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:36,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:19:36,152 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:36,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:36,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1707524859, now seen corresponding path program 1 times [2024-10-12 20:19:36,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:36,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884509964] [2024-10-12 20:19:36,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:36,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:36,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:36,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884509964] [2024-10-12 20:19:36,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884509964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:36,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:36,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:36,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400654458] [2024-10-12 20:19:36,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:36,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:36,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:36,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:36,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:36,244 INFO L87 Difference]: Start difference. First operand 3842 states and 5263 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:36,319 INFO L93 Difference]: Finished difference Result 3848 states and 5266 transitions. [2024-10-12 20:19:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:36,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-12 20:19:36,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:36,324 INFO L225 Difference]: With dead ends: 3848 [2024-10-12 20:19:36,324 INFO L226 Difference]: Without dead ends: 3397 [2024-10-12 20:19:36,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:36,326 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 503 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:36,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 804 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3397 states. [2024-10-12 20:19:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3397 to 3393. [2024-10-12 20:19:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3393 states, 3392 states have (on average 1.3744103773584906) internal successors, (4662), 3392 states have internal predecessors, (4662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3393 states to 3393 states and 4662 transitions. [2024-10-12 20:19:36,364 INFO L78 Accepts]: Start accepts. Automaton has 3393 states and 4662 transitions. Word has length 66 [2024-10-12 20:19:36,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:36,364 INFO L471 AbstractCegarLoop]: Abstraction has 3393 states and 4662 transitions. [2024-10-12 20:19:36,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3393 states and 4662 transitions. [2024-10-12 20:19:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 20:19:36,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:36,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:36,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:19:36,369 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:36,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:36,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1245623863, now seen corresponding path program 1 times [2024-10-12 20:19:36,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:36,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026798958] [2024-10-12 20:19:36,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:36,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:36,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:36,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:36,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026798958] [2024-10-12 20:19:36,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026798958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:36,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:36,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:36,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491794785] [2024-10-12 20:19:36,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:36,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:36,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:36,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:36,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:36,457 INFO L87 Difference]: Start difference. First operand 3393 states and 4662 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:36,499 INFO L93 Difference]: Finished difference Result 7873 states and 10948 transitions. [2024-10-12 20:19:36,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:36,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-12 20:19:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:36,506 INFO L225 Difference]: With dead ends: 7873 [2024-10-12 20:19:36,506 INFO L226 Difference]: Without dead ends: 5533 [2024-10-12 20:19:36,510 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-10-12 20:19:36,511 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 151 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:36,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 549 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5533 states. [2024-10-12 20:19:36,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5533 to 5227. [2024-10-12 20:19:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5227 states, 5226 states have (on average 1.3815537696134712) internal successors, (7220), 5226 states have internal predecessors, (7220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 7220 transitions. [2024-10-12 20:19:36,578 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 7220 transitions. Word has length 67 [2024-10-12 20:19:36,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:36,578 INFO L471 AbstractCegarLoop]: Abstraction has 5227 states and 7220 transitions. [2024-10-12 20:19:36,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 7220 transitions. [2024-10-12 20:19:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 20:19:36,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:36,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:36,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:19:36,583 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:36,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:36,584 INFO L85 PathProgramCache]: Analyzing trace with hash -44903959, now seen corresponding path program 1 times [2024-10-12 20:19:36,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:36,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392370389] [2024-10-12 20:19:36,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:36,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:36,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:36,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392370389] [2024-10-12 20:19:36,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392370389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:36,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:36,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:36,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201914036] [2024-10-12 20:19:36,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:36,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:36,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:36,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:36,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:36,696 INFO L87 Difference]: Start difference. First operand 5227 states and 7220 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:36,755 INFO L93 Difference]: Finished difference Result 12891 states and 17874 transitions. [2024-10-12 20:19:36,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:36,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-12 20:19:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:36,770 INFO L225 Difference]: With dead ends: 12891 [2024-10-12 20:19:36,771 INFO L226 Difference]: Without dead ends: 8465 [2024-10-12 20:19:36,779 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-10-12 20:19:36,779 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 155 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:36,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 537 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:36,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8465 states. [2024-10-12 20:19:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8465 to 7831. [2024-10-12 20:19:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7831 states, 7830 states have (on average 1.3647509578544061) internal successors, (10686), 7830 states have internal predecessors, (10686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7831 states to 7831 states and 10686 transitions. [2024-10-12 20:19:36,909 INFO L78 Accepts]: Start accepts. Automaton has 7831 states and 10686 transitions. Word has length 69 [2024-10-12 20:19:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:36,909 INFO L471 AbstractCegarLoop]: Abstraction has 7831 states and 10686 transitions. [2024-10-12 20:19:36,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:36,910 INFO L276 IsEmpty]: Start isEmpty. Operand 7831 states and 10686 transitions. [2024-10-12 20:19:36,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 20:19:36,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:36,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:36,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 20:19:36,914 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:36,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:36,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1924834057, now seen corresponding path program 1 times [2024-10-12 20:19:36,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:36,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446028683] [2024-10-12 20:19:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:36,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:37,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:37,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446028683] [2024-10-12 20:19:37,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446028683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:37,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:37,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:37,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831418120] [2024-10-12 20:19:37,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:37,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:37,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:37,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:37,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:37,003 INFO L87 Difference]: Start difference. First operand 7831 states and 10686 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:37,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:37,080 INFO L93 Difference]: Finished difference Result 21091 states and 28952 transitions. [2024-10-12 20:19:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:37,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-12 20:19:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:37,099 INFO L225 Difference]: With dead ends: 21091 [2024-10-12 20:19:37,099 INFO L226 Difference]: Without dead ends: 14061 [2024-10-12 20:19:37,112 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-10-12 20:19:37,112 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 107 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:37,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 538 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14061 states. [2024-10-12 20:19:37,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14061 to 12843. [2024-10-12 20:19:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12843 states, 12842 states have (on average 1.361314437003582) internal successors, (17482), 12842 states have internal predecessors, (17482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12843 states to 12843 states and 17482 transitions. [2024-10-12 20:19:37,268 INFO L78 Accepts]: Start accepts. Automaton has 12843 states and 17482 transitions. Word has length 69 [2024-10-12 20:19:37,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:37,268 INFO L471 AbstractCegarLoop]: Abstraction has 12843 states and 17482 transitions. [2024-10-12 20:19:37,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 12843 states and 17482 transitions. [2024-10-12 20:19:37,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 20:19:37,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:37,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:37,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 20:19:37,271 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:37,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:37,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1192896973, now seen corresponding path program 1 times [2024-10-12 20:19:37,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:37,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194242732] [2024-10-12 20:19:37,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:37,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:37,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:37,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194242732] [2024-10-12 20:19:37,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194242732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:37,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:37,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:19:37,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358698576] [2024-10-12 20:19:37,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:37,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:19:37,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:37,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:19:37,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:19:37,493 INFO L87 Difference]: Start difference. First operand 12843 states and 17482 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:37,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:37,550 INFO L93 Difference]: Finished difference Result 14189 states and 19275 transitions. [2024-10-12 20:19:37,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:19:37,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-12 20:19:37,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:37,569 INFO L225 Difference]: With dead ends: 14189 [2024-10-12 20:19:37,569 INFO L226 Difference]: Without dead ends: 14187 [2024-10-12 20:19:37,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:19:37,575 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1343 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-10-12 20:19:37,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1343 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14187 states. [2024-10-12 20:19:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14187 to 14187. [2024-10-12 20:19:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14187 states, 14186 states have (on average 1.3270830396165234) internal successors, (18826), 14186 states have internal predecessors, (18826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:37,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14187 states to 14187 states and 18826 transitions. [2024-10-12 20:19:37,734 INFO L78 Accepts]: Start accepts. Automaton has 14187 states and 18826 transitions. Word has length 71 [2024-10-12 20:19:37,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:37,734 INFO L471 AbstractCegarLoop]: Abstraction has 14187 states and 18826 transitions. [2024-10-12 20:19:37,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 14187 states and 18826 transitions. [2024-10-12 20:19:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:19:37,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:37,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:37,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 20:19:37,738 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:37,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:37,738 INFO L85 PathProgramCache]: Analyzing trace with hash -16724346, now seen corresponding path program 1 times [2024-10-12 20:19:37,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:37,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106722463] [2024-10-12 20:19:37,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:37,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:37,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:37,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106722463] [2024-10-12 20:19:37,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106722463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:37,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:37,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:37,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635084953] [2024-10-12 20:19:37,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:37,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:37,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:37,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:37,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:37,791 INFO L87 Difference]: Start difference. First operand 14187 states and 18826 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:37,892 INFO L93 Difference]: Finished difference Result 34327 states and 45620 transitions. [2024-10-12 20:19:37,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:37,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-12 20:19:37,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:37,924 INFO L225 Difference]: With dead ends: 34327 [2024-10-12 20:19:37,924 INFO L226 Difference]: Without dead ends: 20941 [2024-10-12 20:19:37,943 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-10-12 20:19:37,944 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 170 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:37,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 422 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:37,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20941 states. [2024-10-12 20:19:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20941 to 20715. [2024-10-12 20:19:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20715 states, 20714 states have (on average 1.3066525055518008) internal successors, (27066), 20714 states have internal predecessors, (27066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20715 states to 20715 states and 27066 transitions. [2024-10-12 20:19:38,293 INFO L78 Accepts]: Start accepts. Automaton has 20715 states and 27066 transitions. Word has length 72 [2024-10-12 20:19:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:38,293 INFO L471 AbstractCegarLoop]: Abstraction has 20715 states and 27066 transitions. [2024-10-12 20:19:38,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 20715 states and 27066 transitions. [2024-10-12 20:19:38,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 20:19:38,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:38,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:38,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 20:19:38,297 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:38,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:38,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1274470703, now seen corresponding path program 1 times [2024-10-12 20:19:38,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:38,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613891011] [2024-10-12 20:19:38,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:38,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:38,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:38,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613891011] [2024-10-12 20:19:38,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613891011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:38,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:38,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532635144] [2024-10-12 20:19:38,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:38,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:38,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:38,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:38,394 INFO L87 Difference]: Start difference. First operand 20715 states and 27066 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:38,529 INFO L93 Difference]: Finished difference Result 30635 states and 40267 transitions. [2024-10-12 20:19:38,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:38,530 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-12 20:19:38,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:38,570 INFO L225 Difference]: With dead ends: 30635 [2024-10-12 20:19:38,570 INFO L226 Difference]: Without dead ends: 26061 [2024-10-12 20:19:38,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:38,586 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 610 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:38,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 856 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26061 states. [2024-10-12 20:19:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26061 to 23707. [2024-10-12 20:19:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23707 states, 23706 states have (on average 1.3037205770690965) internal successors, (30906), 23706 states have internal predecessors, (30906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23707 states to 23707 states and 30906 transitions. [2024-10-12 20:19:38,981 INFO L78 Accepts]: Start accepts. Automaton has 23707 states and 30906 transitions. Word has length 73 [2024-10-12 20:19:38,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:38,982 INFO L471 AbstractCegarLoop]: Abstraction has 23707 states and 30906 transitions. [2024-10-12 20:19:38,982 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 23707 states and 30906 transitions. [2024-10-12 20:19:38,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:19:38,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:38,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:38,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 20:19:38,986 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:38,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:38,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2035560395, now seen corresponding path program 1 times [2024-10-12 20:19:38,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:38,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574649162] [2024-10-12 20:19:38,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:38,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:39,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:39,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574649162] [2024-10-12 20:19:39,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574649162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:39,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:39,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:39,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85238431] [2024-10-12 20:19:39,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:39,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:39,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:39,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:39,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:39,075 INFO L87 Difference]: Start difference. First operand 23707 states and 30906 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:39,208 INFO L93 Difference]: Finished difference Result 32071 states and 42039 transitions. [2024-10-12 20:19:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:39,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-12 20:19:39,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:39,240 INFO L225 Difference]: With dead ends: 32071 [2024-10-12 20:19:39,240 INFO L226 Difference]: Without dead ends: 27497 [2024-10-12 20:19:39,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:39,251 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 623 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:39,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 848 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27497 states. [2024-10-12 20:19:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27497 to 26683. [2024-10-12 20:19:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26683 states, 26682 states have (on average 1.301514129375609) internal successors, (34727), 26682 states have internal predecessors, (34727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26683 states to 26683 states and 34727 transitions. [2024-10-12 20:19:39,907 INFO L78 Accepts]: Start accepts. Automaton has 26683 states and 34727 transitions. Word has length 75 [2024-10-12 20:19:39,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:39,907 INFO L471 AbstractCegarLoop]: Abstraction has 26683 states and 34727 transitions. [2024-10-12 20:19:39,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:39,908 INFO L276 IsEmpty]: Start isEmpty. Operand 26683 states and 34727 transitions. [2024-10-12 20:19:39,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:19:39,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:39,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:39,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-12 20:19:39,915 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:39,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:39,916 INFO L85 PathProgramCache]: Analyzing trace with hash -490024547, now seen corresponding path program 1 times [2024-10-12 20:19:39,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:39,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28756916] [2024-10-12 20:19:39,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:39,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:40,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:40,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28756916] [2024-10-12 20:19:40,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28756916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:40,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:40,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:40,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977949416] [2024-10-12 20:19:40,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:40,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:40,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:40,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:40,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:40,024 INFO L87 Difference]: Start difference. First operand 26683 states and 34727 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:40,137 INFO L93 Difference]: Finished difference Result 37923 states and 49683 transitions. [2024-10-12 20:19:40,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:40,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-12 20:19:40,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:40,171 INFO L225 Difference]: With dead ends: 37923 [2024-10-12 20:19:40,171 INFO L226 Difference]: Without dead ends: 31153 [2024-10-12 20:19:40,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:40,185 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 642 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:40,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 836 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:40,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31153 states. [2024-10-12 20:19:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31153 to 30339. [2024-10-12 20:19:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30339 states, 30338 states have (on average 1.298140945349067) internal successors, (39383), 30338 states have internal predecessors, (39383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30339 states to 30339 states and 39383 transitions. [2024-10-12 20:19:40,576 INFO L78 Accepts]: Start accepts. Automaton has 30339 states and 39383 transitions. Word has length 76 [2024-10-12 20:19:40,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:40,576 INFO L471 AbstractCegarLoop]: Abstraction has 30339 states and 39383 transitions. [2024-10-12 20:19:40,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 30339 states and 39383 transitions. [2024-10-12 20:19:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 20:19:40,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:40,586 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:40,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-12 20:19:40,587 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:40,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:40,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1795661640, now seen corresponding path program 1 times [2024-10-12 20:19:40,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:40,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150523930] [2024-10-12 20:19:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 20:19:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:41,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150523930] [2024-10-12 20:19:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150523930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:41,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:41,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:19:41,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606327467] [2024-10-12 20:19:41,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:41,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:19:41,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:41,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:19:41,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:19:41,042 INFO L87 Difference]: Start difference. First operand 30339 states and 39383 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:41,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:41,582 INFO L93 Difference]: Finished difference Result 60654 states and 78448 transitions. [2024-10-12 20:19:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:19:41,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 20:19:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:41,736 INFO L225 Difference]: With dead ends: 60654 [2024-10-12 20:19:41,736 INFO L226 Difference]: Without dead ends: 39340 [2024-10-12 20:19:41,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:19:41,753 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1112 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:41,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 690 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39340 states. [2024-10-12 20:19:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39340 to 30223. [2024-10-12 20:19:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30223 states, 30222 states have (on average 1.298358811461849) internal successors, (39239), 30222 states have internal predecessors, (39239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30223 states to 30223 states and 39239 transitions. [2024-10-12 20:19:42,187 INFO L78 Accepts]: Start accepts. Automaton has 30223 states and 39239 transitions. Word has length 91 [2024-10-12 20:19:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:42,187 INFO L471 AbstractCegarLoop]: Abstraction has 30223 states and 39239 transitions. [2024-10-12 20:19:42,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 30223 states and 39239 transitions. [2024-10-12 20:19:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 20:19:42,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:42,196 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:42,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-12 20:19:42,196 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:42,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash -732608151, now seen corresponding path program 1 times [2024-10-12 20:19:42,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:42,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732922094] [2024-10-12 20:19:42,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:42,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 20:19:42,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:42,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732922094] [2024-10-12 20:19:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732922094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:42,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:42,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:19:42,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495802750] [2024-10-12 20:19:42,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:42,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:19:42,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:42,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:19:42,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:19:42,447 INFO L87 Difference]: Start difference. First operand 30223 states and 39239 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:43,190 INFO L93 Difference]: Finished difference Result 62205 states and 80701 transitions. [2024-10-12 20:19:43,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:19:43,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 20:19:43,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:43,237 INFO L225 Difference]: With dead ends: 62205 [2024-10-12 20:19:43,237 INFO L226 Difference]: Without dead ends: 46639 [2024-10-12 20:19:43,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:19:43,257 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1086 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:43,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 780 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:19:43,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46639 states. [2024-10-12 20:19:43,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46639 to 30177. [2024-10-12 20:19:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30177 states, 30176 states have (on average 1.2983828207847297) internal successors, (39180), 30176 states have internal predecessors, (39180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30177 states to 30177 states and 39180 transitions. [2024-10-12 20:19:43,683 INFO L78 Accepts]: Start accepts. Automaton has 30177 states and 39180 transitions. Word has length 91 [2024-10-12 20:19:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:43,684 INFO L471 AbstractCegarLoop]: Abstraction has 30177 states and 39180 transitions. [2024-10-12 20:19:43,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:43,684 INFO L276 IsEmpty]: Start isEmpty. Operand 30177 states and 39180 transitions. [2024-10-12 20:19:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:19:43,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:43,693 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:43,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-12 20:19:43,693 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:43,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:43,694 INFO L85 PathProgramCache]: Analyzing trace with hash -365813274, now seen corresponding path program 1 times [2024-10-12 20:19:43,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:43,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657038199] [2024-10-12 20:19:43,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:43,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:44,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:44,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657038199] [2024-10-12 20:19:44,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657038199] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:19:44,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244291113] [2024-10-12 20:19:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:44,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:44,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:44,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:19:44,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:19:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:44,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-12 20:19:44,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:19:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:45,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:19:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:47,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244291113] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:19:47,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:19:47,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 13] total 28 [2024-10-12 20:19:47,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844761997] [2024-10-12 20:19:47,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:19:47,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-12 20:19:47,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:47,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 20:19:47,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2024-10-12 20:19:47,006 INFO L87 Difference]: Start difference. First operand 30177 states and 39180 transitions. Second operand has 29 states, 29 states have (on average 7.931034482758621) internal successors, (230), 28 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:58,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:58,462 INFO L93 Difference]: Finished difference Result 207059 states and 263891 transitions. [2024-10-12 20:19:58,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2024-10-12 20:19:58,463 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.931034482758621) internal successors, (230), 28 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-12 20:19:58,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:58,690 INFO L225 Difference]: With dead ends: 207059 [2024-10-12 20:19:58,690 INFO L226 Difference]: Without dead ends: 191153 [2024-10-12 20:19:58,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14876 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=6348, Invalid=33852, Unknown=0, NotChecked=0, Total=40200 [2024-10-12 20:19:58,722 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 6938 mSDsluCounter, 6636 mSDsCounter, 0 mSdLazyCounter, 6481 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6938 SdHoareTripleChecker+Valid, 7116 SdHoareTripleChecker+Invalid, 6616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 6481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:58,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6938 Valid, 7116 Invalid, 6616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 6481 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-12 20:19:58,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191153 states. [2024-10-12 20:20:00,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191153 to 30680. [2024-10-12 20:20:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30680 states, 30679 states have (on average 1.2975325140975913) internal successors, (39807), 30679 states have internal predecessors, (39807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30680 states to 30680 states and 39807 transitions. [2024-10-12 20:20:00,156 INFO L78 Accepts]: Start accepts. Automaton has 30680 states and 39807 transitions. Word has length 92 [2024-10-12 20:20:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:00,156 INFO L471 AbstractCegarLoop]: Abstraction has 30680 states and 39807 transitions. [2024-10-12 20:20:00,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.931034482758621) internal successors, (230), 28 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:00,156 INFO L276 IsEmpty]: Start isEmpty. Operand 30680 states and 39807 transitions. [2024-10-12 20:20:00,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:20:00,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:00,164 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:20:00,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:20:00,365 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,SelfDestructingSolverStorable33 [2024-10-12 20:20:00,365 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:20:00,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:00,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1504612839, now seen corresponding path program 1 times [2024-10-12 20:20:00,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:00,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878878534] [2024-10-12 20:20:00,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:00,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:00,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:00,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878878534] [2024-10-12 20:20:00,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878878534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:00,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:00,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:20:00,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684864727] [2024-10-12 20:20:00,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:00,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:20:00,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:00,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:20:00,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:20:00,783 INFO L87 Difference]: Start difference. First operand 30680 states and 39807 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:01,359 INFO L93 Difference]: Finished difference Result 71436 states and 92356 transitions. [2024-10-12 20:20:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:20:01,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-12 20:20:01,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:01,422 INFO L225 Difference]: With dead ends: 71436 [2024-10-12 20:20:01,422 INFO L226 Difference]: Without dead ends: 55943 [2024-10-12 20:20:01,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:20:01,444 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 1162 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:01,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 1011 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:20:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55943 states. [2024-10-12 20:20:01,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55943 to 48476. [2024-10-12 20:20:01,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48476 states, 48475 states have (on average 1.29706034038164) internal successors, (62875), 48475 states have internal predecessors, (62875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48476 states to 48476 states and 62875 transitions. [2024-10-12 20:20:02,006 INFO L78 Accepts]: Start accepts. Automaton has 48476 states and 62875 transitions. Word has length 92 [2024-10-12 20:20:02,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:02,006 INFO L471 AbstractCegarLoop]: Abstraction has 48476 states and 62875 transitions. [2024-10-12 20:20:02,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 48476 states and 62875 transitions. [2024-10-12 20:20:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:20:02,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:02,015 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:20:02,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-12 20:20:02,015 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:20:02,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:02,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1675726985, now seen corresponding path program 1 times [2024-10-12 20:20:02,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:02,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960861905] [2024-10-12 20:20:02,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:02,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:02,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:02,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960861905] [2024-10-12 20:20:02,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960861905] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:20:02,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452954819] [2024-10-12 20:20:02,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:02,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:20:02,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:20:02,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:20:02,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 20:20:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:02,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-12 20:20:02,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:20:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:03,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:20:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:04,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452954819] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:20:04,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:20:04,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 13] total 28 [2024-10-12 20:20:04,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600107024] [2024-10-12 20:20:04,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:20:04,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-12 20:20:04,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:04,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 20:20:04,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2024-10-12 20:20:04,794 INFO L87 Difference]: Start difference. First operand 48476 states and 62875 transitions. Second operand has 29 states, 29 states have (on average 8.241379310344827) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:13,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:13,781 INFO L93 Difference]: Finished difference Result 268268 states and 343420 transitions. [2024-10-12 20:20:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-10-12 20:20:13,782 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.241379310344827) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-12 20:20:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:14,084 INFO L225 Difference]: With dead ends: 268268 [2024-10-12 20:20:14,084 INFO L226 Difference]: Without dead ends: 245018 [2024-10-12 20:20:14,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12158 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5682, Invalid=25824, Unknown=0, NotChecked=0, Total=31506 [2024-10-12 20:20:14,350 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 5102 mSDsluCounter, 5210 mSDsCounter, 0 mSdLazyCounter, 5577 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5102 SdHoareTripleChecker+Valid, 5626 SdHoareTripleChecker+Invalid, 5703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 5577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:14,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5102 Valid, 5626 Invalid, 5703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 5577 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 20:20:14,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245018 states. [2024-10-12 20:20:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245018 to 93726. [2024-10-12 20:20:15,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93726 states, 93725 states have (on average 1.2963670312083222) internal successors, (121502), 93725 states have internal predecessors, (121502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93726 states to 93726 states and 121502 transitions. [2024-10-12 20:20:16,162 INFO L78 Accepts]: Start accepts. Automaton has 93726 states and 121502 transitions. Word has length 92 [2024-10-12 20:20:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:16,162 INFO L471 AbstractCegarLoop]: Abstraction has 93726 states and 121502 transitions. [2024-10-12 20:20:16,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.241379310344827) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 93726 states and 121502 transitions. [2024-10-12 20:20:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 20:20:16,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:16,192 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:20:16,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 20:20:16,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-10-12 20:20:16,393 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:20:16,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:16,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1965411061, now seen corresponding path program 1 times [2024-10-12 20:20:16,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:16,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794444505] [2024-10-12 20:20:16,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:16,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:16,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 20:20:16,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:16,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794444505] [2024-10-12 20:20:16,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794444505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:16,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:16,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:20:16,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888501346] [2024-10-12 20:20:16,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:16,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:20:16,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:16,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:20:16,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:16,451 INFO L87 Difference]: Start difference. First operand 93726 states and 121502 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:16,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:16,878 INFO L93 Difference]: Finished difference Result 185039 states and 240217 transitions. [2024-10-12 20:20:16,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:20:16,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-12 20:20:16,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:16,978 INFO L225 Difference]: With dead ends: 185039 [2024-10-12 20:20:16,978 INFO L226 Difference]: Without dead ends: 93071 [2024-10-12 20:20:17,032 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-10-12 20:20:17,033 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 213 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:17,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 254 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:20:17,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93071 states. [2024-10-12 20:20:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93071 to 93071. [2024-10-12 20:20:18,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93071 states, 93070 states have (on average 1.2816482217685612) internal successors, (119283), 93070 states have internal predecessors, (119283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93071 states to 93071 states and 119283 transitions. [2024-10-12 20:20:18,593 INFO L78 Accepts]: Start accepts. Automaton has 93071 states and 119283 transitions. Word has length 93 [2024-10-12 20:20:18,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:18,593 INFO L471 AbstractCegarLoop]: Abstraction has 93071 states and 119283 transitions. [2024-10-12 20:20:18,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:18,594 INFO L276 IsEmpty]: Start isEmpty. Operand 93071 states and 119283 transitions. [2024-10-12 20:20:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 20:20:18,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:18,604 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:20:18,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-12 20:20:18,604 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:20:18,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:18,605 INFO L85 PathProgramCache]: Analyzing trace with hash -225364972, now seen corresponding path program 1 times [2024-10-12 20:20:18,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:18,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979574603] [2024-10-12 20:20:18,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:18,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:18,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:18,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979574603] [2024-10-12 20:20:18,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979574603] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:20:18,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151118834] [2024-10-12 20:20:18,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:18,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:20:18,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:20:18,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:20:18,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 20:20:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:18,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 20:20:18,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:20:19,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:19,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:20:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:20,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151118834] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:20:20,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:20:20,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 10] total 17 [2024-10-12 20:20:20,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623566385] [2024-10-12 20:20:20,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:20:20,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-12 20:20:20,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:20,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 20:20:20,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:20:20,204 INFO L87 Difference]: Start difference. First operand 93071 states and 119283 transitions. Second operand has 17 states, 17 states have (on average 12.705882352941176) internal successors, (216), 17 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:23,927 INFO L93 Difference]: Finished difference Result 534849 states and 679594 transitions. [2024-10-12 20:20:23,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-12 20:20:23,927 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 12.705882352941176) internal successors, (216), 17 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-12 20:20:23,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:24,747 INFO L225 Difference]: With dead ends: 534849 [2024-10-12 20:20:24,747 INFO L226 Difference]: Without dead ends: 443751 [2024-10-12 20:20:24,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1865 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1181, Invalid=4075, Unknown=0, NotChecked=0, Total=5256 [2024-10-12 20:20:24,890 INFO L432 NwaCegarLoop]: 1018 mSDtfsCounter, 4563 mSDsluCounter, 4856 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4563 SdHoareTripleChecker+Valid, 5874 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:24,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4563 Valid, 5874 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:20:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443751 states. [2024-10-12 20:20:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443751 to 333509. [2024-10-12 20:20:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333509 states, 333508 states have (on average 1.2670820490063206) internal successors, (422582), 333508 states have internal predecessors, (422582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)