./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.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 da0a9170cb1355df936e020ec31cd269723d3c83f610103689e93f9c7ac8eb3a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:49:54,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:49:54,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:49:54,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:49:54,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:49:54,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:49:54,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:49:54,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:49:54,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:49:54,783 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:49:54,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:49:54,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:49:54,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:49:54,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:49:54,786 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:49:54,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:49:54,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:49:54,787 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:49:54,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:49:54,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:49:54,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:49:54,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:49:54,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:49:54,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:49:54,790 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:49:54,790 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:49:54,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:49:54,791 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:49:54,791 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:49:54,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:49:54,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:49:54,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:49:54,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:49:54,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:49:54,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:49:54,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:49:54,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:49:54,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:49:54,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:49:54,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:49:54,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:49:54,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:49:54,798 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 -> da0a9170cb1355df936e020ec31cd269723d3c83f610103689e93f9c7ac8eb3a [2024-11-08 15:49:54,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:49:55,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:49:55,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:49:55,026 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:49:55,026 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:49:55,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-08 15:49:56,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:49:56,598 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:49:56,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-08 15:49:56,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2b3f869/14dac8904c914878b38c488a6810c627/FLAG924652d4f [2024-11-08 15:49:56,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2b3f869/14dac8904c914878b38c488a6810c627 [2024-11-08 15:49:56,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:49:56,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:49:56,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:49:56,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:49:56,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:49:56,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:49:56" (1/1) ... [2024-11-08 15:49:56,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f1a6661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:56, skipping insertion in model container [2024-11-08 15:49:56,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:49:56" (1/1) ... [2024-11-08 15:49:57,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:49:57,293 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14146,14159] [2024-11-08 15:49:57,305 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14793,14806] [2024-11-08 15:49:57,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16069,16082] [2024-11-08 15:49:57,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17045,17058] [2024-11-08 15:49:57,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25516,25529] [2024-11-08 15:49:57,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:49:57,542 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:49:57,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14146,14159] [2024-11-08 15:49:57,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14793,14806] [2024-11-08 15:49:57,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16069,16082] [2024-11-08 15:49:57,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17045,17058] [2024-11-08 15:49:57,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25516,25529] [2024-11-08 15:49:57,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:49:57,707 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:49:57,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:57 WrapperNode [2024-11-08 15:49:57,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:49:57,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:49:57,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:49:57,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:49:57,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:57" (1/1) ... [2024-11-08 15:49:57,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:57" (1/1) ... [2024-11-08 15:49:57,791 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1639 [2024-11-08 15:49:57,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:49:57,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:49:57,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:49:57,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:49:57,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:57" (1/1) ... [2024-11-08 15:49:57,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:57" (1/1) ... [2024-11-08 15:49:57,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:57" (1/1) ... [2024-11-08 15:49:57,825 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-11-08 15:49:57,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:57" (1/1) ... [2024-11-08 15:49:57,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:57" (1/1) ... [2024-11-08 15:49:57,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:57" (1/1) ... [2024-11-08 15:49:57,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:57" (1/1) ... [2024-11-08 15:49:57,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:57" (1/1) ... [2024-11-08 15:49:57,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:57" (1/1) ... [2024-11-08 15:49:57,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:49:57,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:49:57,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:49:57,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:49:57,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:57" (1/1) ... [2024-11-08 15:49:57,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:49:57,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:49:57,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:49:57,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:49:57,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:49:57,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:49:57,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:49:57,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:49:58,060 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:49:58,062 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:49:59,036 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-08 15:49:59,036 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:49:59,056 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:49:59,056 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:49:59,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:49:59 BoogieIcfgContainer [2024-11-08 15:49:59,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:49:59,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:49:59,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:49:59,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:49:59,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:49:56" (1/3) ... [2024-11-08 15:49:59,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b1bf6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:49:59, skipping insertion in model container [2024-11-08 15:49:59,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:57" (2/3) ... [2024-11-08 15:49:59,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b1bf6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:49:59, skipping insertion in model container [2024-11-08 15:49:59,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:49:59" (3/3) ... [2024-11-08 15:49:59,065 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-08 15:49:59,078 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:49:59,078 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-11-08 15:49:59,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:49:59,155 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;@450dbe54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:49:59,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-08 15:49:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 388 states, 382 states have (on average 1.824607329842932) internal successors, (697), 387 states have internal predecessors, (697), 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-11-08 15:49:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 15:49:59,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:59,187 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:49:59,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:49:59,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:59,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1860790591, now seen corresponding path program 1 times [2024-11-08 15:49:59,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:59,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096916992] [2024-11-08 15:49:59,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:59,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:59,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:59,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:59,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096916992] [2024-11-08 15:49:59,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096916992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:59,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:59,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:49:59,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643665668] [2024-11-08 15:49:59,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:59,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:49:59,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:59,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:49:59,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:59,777 INFO L87 Difference]: Start difference. First operand has 388 states, 382 states have (on average 1.824607329842932) internal successors, (697), 387 states have internal predecessors, (697), 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 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-11-08 15:49:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:59,945 INFO L93 Difference]: Finished difference Result 717 states and 1276 transitions. [2024-11-08 15:49:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:49:59,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 141 [2024-11-08 15:49:59,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:59,965 INFO L225 Difference]: With dead ends: 717 [2024-11-08 15:49:59,965 INFO L226 Difference]: Without dead ends: 589 [2024-11-08 15:49:59,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:59,972 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 424 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:59,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1246 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:49:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-08 15:50:00,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 587. [2024-11-08 15:50:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 582 states have (on average 1.4793814432989691) internal successors, (861), 586 states have internal predecessors, (861), 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-11-08 15:50:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 861 transitions. [2024-11-08 15:50:00,029 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 861 transitions. Word has length 141 [2024-11-08 15:50:00,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:00,030 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 861 transitions. [2024-11-08 15:50:00,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-11-08 15:50:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 861 transitions. [2024-11-08 15:50:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 15:50:00,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:00,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:00,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:50:00,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:00,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:00,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1860359615, now seen corresponding path program 1 times [2024-11-08 15:50:00,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:00,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296939749] [2024-11-08 15:50:00,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:00,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:00,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:00,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:00,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296939749] [2024-11-08 15:50:00,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296939749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:00,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:00,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:00,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656437822] [2024-11-08 15:50:00,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:00,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:00,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:00,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:00,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:00,635 INFO L87 Difference]: Start difference. First operand 587 states and 861 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-11-08 15:50:00,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:00,765 INFO L93 Difference]: Finished difference Result 2254 states and 3288 transitions. [2024-11-08 15:50:00,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:00,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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 141 [2024-11-08 15:50:00,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:00,771 INFO L225 Difference]: With dead ends: 2254 [2024-11-08 15:50:00,771 INFO L226 Difference]: Without dead ends: 1692 [2024-11-08 15:50:00,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:00,774 INFO L432 NwaCegarLoop]: 970 mSDtfsCounter, 1057 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:00,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 1965 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2024-11-08 15:50:00,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1103. [2024-11-08 15:50:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 1098 states have (on average 1.4690346083788706) internal successors, (1613), 1102 states have internal predecessors, (1613), 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-11-08 15:50:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1613 transitions. [2024-11-08 15:50:00,824 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1613 transitions. Word has length 141 [2024-11-08 15:50:00,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:00,825 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1613 transitions. [2024-11-08 15:50:00,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-11-08 15:50:00,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1613 transitions. [2024-11-08 15:50:00,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 15:50:00,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:00,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:00,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:50:00,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:00,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:00,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1839649003, now seen corresponding path program 1 times [2024-11-08 15:50:00,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:00,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743109250] [2024-11-08 15:50:00,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:00,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:00,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:00,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743109250] [2024-11-08 15:50:00,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743109250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:00,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:00,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:00,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179584193] [2024-11-08 15:50:00,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:00,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:00,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:00,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:00,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:00,938 INFO L87 Difference]: Start difference. First operand 1103 states and 1613 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-11-08 15:50:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:00,964 INFO L93 Difference]: Finished difference Result 2180 states and 3182 transitions. [2024-11-08 15:50:00,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:00,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 142 [2024-11-08 15:50:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:00,968 INFO L225 Difference]: With dead ends: 2180 [2024-11-08 15:50:00,969 INFO L226 Difference]: Without dead ends: 1105 [2024-11-08 15:50:00,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:00,972 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 0 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:00,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1098 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-11-08 15:50:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1105. [2024-11-08 15:50:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1100 states have (on average 1.4681818181818183) internal successors, (1615), 1104 states have internal predecessors, (1615), 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-11-08 15:50:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1615 transitions. [2024-11-08 15:50:00,995 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1615 transitions. Word has length 142 [2024-11-08 15:50:00,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:00,996 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1615 transitions. [2024-11-08 15:50:00,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-11-08 15:50:00,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1615 transitions. [2024-11-08 15:50:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 15:50:00,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:00,998 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:00,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:50:00,998 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:00,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:00,999 INFO L85 PathProgramCache]: Analyzing trace with hash 734467803, now seen corresponding path program 1 times [2024-11-08 15:50:00,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:01,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181184779] [2024-11-08 15:50:01,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:01,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:01,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:01,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181184779] [2024-11-08 15:50:01,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181184779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:01,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:01,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:01,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485012723] [2024-11-08 15:50:01,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:01,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:01,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:01,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:01,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:01,089 INFO L87 Difference]: Start difference. First operand 1105 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-11-08 15:50:01,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:01,137 INFO L93 Difference]: Finished difference Result 3075 states and 4502 transitions. [2024-11-08 15:50:01,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:01,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 143 [2024-11-08 15:50:01,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:01,143 INFO L225 Difference]: With dead ends: 3075 [2024-11-08 15:50:01,143 INFO L226 Difference]: Without dead ends: 2146 [2024-11-08 15:50:01,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:01,145 INFO L432 NwaCegarLoop]: 1013 mSDtfsCounter, 478 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:01,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1520 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2024-11-08 15:50:01,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2108. [2024-11-08 15:50:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 2103 states have (on average 1.4555397051830719) internal successors, (3061), 2107 states have internal predecessors, (3061), 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-11-08 15:50:01,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 3061 transitions. [2024-11-08 15:50:01,174 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 3061 transitions. Word has length 143 [2024-11-08 15:50:01,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:01,175 INFO L471 AbstractCegarLoop]: Abstraction has 2108 states and 3061 transitions. [2024-11-08 15:50:01,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-11-08 15:50:01,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 3061 transitions. [2024-11-08 15:50:01,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 15:50:01,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:01,177 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:01,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:50:01,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:01,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:01,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1947336930, now seen corresponding path program 1 times [2024-11-08 15:50:01,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:01,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047347015] [2024-11-08 15:50:01,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:01,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:01,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:01,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047347015] [2024-11-08 15:50:01,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047347015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:01,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:01,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:01,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393607064] [2024-11-08 15:50:01,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:01,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:01,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:01,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:01,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:01,580 INFO L87 Difference]: Start difference. First operand 2108 states and 3061 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-11-08 15:50:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:01,650 INFO L93 Difference]: Finished difference Result 3559 states and 5175 transitions. [2024-11-08 15:50:01,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:01,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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 143 [2024-11-08 15:50:01,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:01,655 INFO L225 Difference]: With dead ends: 3559 [2024-11-08 15:50:01,656 INFO L226 Difference]: Without dead ends: 1617 [2024-11-08 15:50:01,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:01,663 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 25 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:01,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1732 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2024-11-08 15:50:01,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2024-11-08 15:50:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1612 states have (on average 1.4491315136476426) internal successors, (2336), 1616 states have internal predecessors, (2336), 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-11-08 15:50:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2336 transitions. [2024-11-08 15:50:01,718 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2336 transitions. Word has length 143 [2024-11-08 15:50:01,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:01,719 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2336 transitions. [2024-11-08 15:50:01,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-11-08 15:50:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2336 transitions. [2024-11-08 15:50:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 15:50:01,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:01,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:01,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:50:01,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:01,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:01,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1943179396, now seen corresponding path program 1 times [2024-11-08 15:50:01,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:01,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942010298] [2024-11-08 15:50:01,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:01,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:02,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:02,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942010298] [2024-11-08 15:50:02,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942010298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:02,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:02,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:02,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087540727] [2024-11-08 15:50:02,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:02,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:02,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:02,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:02,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:02,247 INFO L87 Difference]: Start difference. First operand 1617 states and 2336 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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-11-08 15:50:02,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:02,357 INFO L93 Difference]: Finished difference Result 3195 states and 4769 transitions. [2024-11-08 15:50:02,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:02,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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 149 [2024-11-08 15:50:02,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:02,365 INFO L225 Difference]: With dead ends: 3195 [2024-11-08 15:50:02,368 INFO L226 Difference]: Without dead ends: 2613 [2024-11-08 15:50:02,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:02,370 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 876 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:02,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 986 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2613 states. [2024-11-08 15:50:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2613 to 2611. [2024-11-08 15:50:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2611 states, 2606 states have (on average 1.4608595548733692) internal successors, (3807), 2610 states have internal predecessors, (3807), 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-11-08 15:50:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 3807 transitions. [2024-11-08 15:50:02,440 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 3807 transitions. Word has length 149 [2024-11-08 15:50:02,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:02,440 INFO L471 AbstractCegarLoop]: Abstraction has 2611 states and 3807 transitions. [2024-11-08 15:50:02,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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-11-08 15:50:02,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3807 transitions. [2024-11-08 15:50:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 15:50:02,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:02,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:02,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:50:02,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:02,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:02,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1091266556, now seen corresponding path program 1 times [2024-11-08 15:50:02,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:02,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009832054] [2024-11-08 15:50:02,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:02,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:02,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:02,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009832054] [2024-11-08 15:50:02,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009832054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:02,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:02,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159253690] [2024-11-08 15:50:02,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:02,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:02,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:02,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:02,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:02,758 INFO L87 Difference]: Start difference. First operand 2611 states and 3807 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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-11-08 15:50:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:02,853 INFO L93 Difference]: Finished difference Result 6766 states and 9838 transitions. [2024-11-08 15:50:02,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:50:02,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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 149 [2024-11-08 15:50:02,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:02,864 INFO L225 Difference]: With dead ends: 6766 [2024-11-08 15:50:02,864 INFO L226 Difference]: Without dead ends: 4174 [2024-11-08 15:50:02,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:50:02,869 INFO L432 NwaCegarLoop]: 794 mSDtfsCounter, 482 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:02,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 2050 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:02,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4174 states. [2024-11-08 15:50:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4174 to 4144. [2024-11-08 15:50:02,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4139 states have (on average 1.4406861560763469) internal successors, (5963), 4143 states have internal predecessors, (5963), 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-11-08 15:50:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5963 transitions. [2024-11-08 15:50:02,933 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5963 transitions. Word has length 149 [2024-11-08 15:50:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:02,933 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5963 transitions. [2024-11-08 15:50:02,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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-11-08 15:50:02,934 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5963 transitions. [2024-11-08 15:50:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 15:50:02,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:02,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:02,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:50:02,938 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:02,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:02,938 INFO L85 PathProgramCache]: Analyzing trace with hash 872222087, now seen corresponding path program 1 times [2024-11-08 15:50:02,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:02,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136599009] [2024-11-08 15:50:02,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:02,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:03,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:03,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136599009] [2024-11-08 15:50:03,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136599009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:03,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:03,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:03,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055954126] [2024-11-08 15:50:03,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:03,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:03,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:03,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:03,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:03,029 INFO L87 Difference]: Start difference. First operand 4144 states and 5963 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-11-08 15:50:03,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:03,063 INFO L93 Difference]: Finished difference Result 9045 states and 13014 transitions. [2024-11-08 15:50:03,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:03,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 150 [2024-11-08 15:50:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:03,077 INFO L225 Difference]: With dead ends: 9045 [2024-11-08 15:50:03,078 INFO L226 Difference]: Without dead ends: 5819 [2024-11-08 15:50:03,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:03,084 INFO L432 NwaCegarLoop]: 1001 mSDtfsCounter, 519 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:03,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1544 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5819 states. [2024-11-08 15:50:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5819 to 4144. [2024-11-08 15:50:03,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4139 states have (on average 1.440444551824112) internal successors, (5962), 4143 states have internal predecessors, (5962), 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-11-08 15:50:03,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5962 transitions. [2024-11-08 15:50:03,160 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5962 transitions. Word has length 150 [2024-11-08 15:50:03,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:03,161 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5962 transitions. [2024-11-08 15:50:03,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-11-08 15:50:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5962 transitions. [2024-11-08 15:50:03,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 15:50:03,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:03,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:03,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:50:03,165 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:03,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:03,166 INFO L85 PathProgramCache]: Analyzing trace with hash 332518950, now seen corresponding path program 1 times [2024-11-08 15:50:03,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:03,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263407094] [2024-11-08 15:50:03,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:03,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:03,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:03,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:03,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263407094] [2024-11-08 15:50:03,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263407094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:03,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:03,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:03,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938824208] [2024-11-08 15:50:03,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:03,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:03,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:03,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:03,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:03,240 INFO L87 Difference]: Start difference. First operand 4144 states and 5962 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-11-08 15:50:03,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:03,313 INFO L93 Difference]: Finished difference Result 10908 states and 15673 transitions. [2024-11-08 15:50:03,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:03,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 151 [2024-11-08 15:50:03,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:03,332 INFO L225 Difference]: With dead ends: 10908 [2024-11-08 15:50:03,333 INFO L226 Difference]: Without dead ends: 7095 [2024-11-08 15:50:03,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:03,340 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 470 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:03,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1513 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:03,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7095 states. [2024-11-08 15:50:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7095 to 7069. [2024-11-08 15:50:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7069 states, 7064 states have (on average 1.4166194790486977) internal successors, (10007), 7068 states have internal predecessors, (10007), 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-11-08 15:50:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7069 states to 7069 states and 10007 transitions. [2024-11-08 15:50:03,571 INFO L78 Accepts]: Start accepts. Automaton has 7069 states and 10007 transitions. Word has length 151 [2024-11-08 15:50:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:03,572 INFO L471 AbstractCegarLoop]: Abstraction has 7069 states and 10007 transitions. [2024-11-08 15:50:03,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-11-08 15:50:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 7069 states and 10007 transitions. [2024-11-08 15:50:03,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 15:50:03,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:03,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:03,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:50:03,579 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:03,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:03,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1116979159, now seen corresponding path program 1 times [2024-11-08 15:50:03,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:03,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141497341] [2024-11-08 15:50:03,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:03,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:03,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:03,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141497341] [2024-11-08 15:50:03,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141497341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:03,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:03,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:03,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076213603] [2024-11-08 15:50:03,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:03,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:03,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:03,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:03,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:03,836 INFO L87 Difference]: Start difference. First operand 7069 states and 10007 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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-11-08 15:50:03,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:03,963 INFO L93 Difference]: Finished difference Result 27281 states and 38473 transitions. [2024-11-08 15:50:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:03,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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 151 [2024-11-08 15:50:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:04,065 INFO L225 Difference]: With dead ends: 27281 [2024-11-08 15:50:04,066 INFO L226 Difference]: Without dead ends: 20275 [2024-11-08 15:50:04,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:04,072 INFO L432 NwaCegarLoop]: 954 mSDtfsCounter, 1033 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:04,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1940 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:04,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20275 states. [2024-11-08 15:50:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20275 to 13621. [2024-11-08 15:50:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13621 states, 13616 states have (on average 1.4007784958871916) internal successors, (19073), 13620 states have internal predecessors, (19073), 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-11-08 15:50:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13621 states to 13621 states and 19073 transitions. [2024-11-08 15:50:04,281 INFO L78 Accepts]: Start accepts. Automaton has 13621 states and 19073 transitions. Word has length 151 [2024-11-08 15:50:04,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:04,281 INFO L471 AbstractCegarLoop]: Abstraction has 13621 states and 19073 transitions. [2024-11-08 15:50:04,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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-11-08 15:50:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 13621 states and 19073 transitions. [2024-11-08 15:50:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 15:50:04,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:04,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:04,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:50:04,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:04,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:04,294 INFO L85 PathProgramCache]: Analyzing trace with hash 917589273, now seen corresponding path program 1 times [2024-11-08 15:50:04,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:04,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070357904] [2024-11-08 15:50:04,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:04,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:04,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:04,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070357904] [2024-11-08 15:50:04,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070357904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:04,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:04,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:04,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243391943] [2024-11-08 15:50:04,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:04,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:04,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:04,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:04,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:04,351 INFO L87 Difference]: Start difference. First operand 13621 states and 19073 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-11-08 15:50:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:04,477 INFO L93 Difference]: Finished difference Result 27134 states and 37995 transitions. [2024-11-08 15:50:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:04,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 152 [2024-11-08 15:50:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:04,498 INFO L225 Difference]: With dead ends: 27134 [2024-11-08 15:50:04,499 INFO L226 Difference]: Without dead ends: 13629 [2024-11-08 15:50:04,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:04,513 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 0 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:04,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1092 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13629 states. [2024-11-08 15:50:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13629 to 13629. [2024-11-08 15:50:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13629 states, 13624 states have (on average 1.4005431591309454) internal successors, (19081), 13628 states have internal predecessors, (19081), 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-11-08 15:50:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13629 states to 13629 states and 19081 transitions. [2024-11-08 15:50:04,725 INFO L78 Accepts]: Start accepts. Automaton has 13629 states and 19081 transitions. Word has length 152 [2024-11-08 15:50:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:04,726 INFO L471 AbstractCegarLoop]: Abstraction has 13629 states and 19081 transitions. [2024-11-08 15:50:04,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-11-08 15:50:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 13629 states and 19081 transitions. [2024-11-08 15:50:04,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 15:50:04,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:04,740 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:04,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:50:04,740 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:04,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:04,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2048196385, now seen corresponding path program 1 times [2024-11-08 15:50:04,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:04,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869596652] [2024-11-08 15:50:04,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:04,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:04,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:04,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869596652] [2024-11-08 15:50:04,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869596652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:04,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:04,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:04,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062280469] [2024-11-08 15:50:04,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:04,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:04,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:04,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:04,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:04,833 INFO L87 Difference]: Start difference. First operand 13629 states and 19081 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-11-08 15:50:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:04,968 INFO L93 Difference]: Finished difference Result 39246 states and 54902 transitions. [2024-11-08 15:50:04,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:04,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 153 [2024-11-08 15:50:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:05,012 INFO L225 Difference]: With dead ends: 39246 [2024-11-08 15:50:05,012 INFO L226 Difference]: Without dead ends: 26427 [2024-11-08 15:50:05,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:05,037 INFO L432 NwaCegarLoop]: 1027 mSDtfsCounter, 468 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:05,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1535 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:05,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26427 states. [2024-11-08 15:50:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26427 to 26370. [2024-11-08 15:50:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26370 states, 26365 states have (on average 1.3827422719514508) internal successors, (36456), 26369 states have internal predecessors, (36456), 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-11-08 15:50:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26370 states to 26370 states and 36456 transitions. [2024-11-08 15:50:05,493 INFO L78 Accepts]: Start accepts. Automaton has 26370 states and 36456 transitions. Word has length 153 [2024-11-08 15:50:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:05,493 INFO L471 AbstractCegarLoop]: Abstraction has 26370 states and 36456 transitions. [2024-11-08 15:50:05,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-11-08 15:50:05,494 INFO L276 IsEmpty]: Start isEmpty. Operand 26370 states and 36456 transitions. [2024-11-08 15:50:05,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 15:50:05,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:05,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:05,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:50:05,515 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:05,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash 540544484, now seen corresponding path program 1 times [2024-11-08 15:50:05,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:05,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57560868] [2024-11-08 15:50:05,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:05,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:05,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57560868] [2024-11-08 15:50:05,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57560868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:05,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:05,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:05,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203387293] [2024-11-08 15:50:05,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:05,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:05,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:05,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:05,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:05,789 INFO L87 Difference]: Start difference. First operand 26370 states and 36456 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-11-08 15:50:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:06,000 INFO L93 Difference]: Finished difference Result 45834 states and 63410 transitions. [2024-11-08 15:50:06,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:06,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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 153 [2024-11-08 15:50:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:06,025 INFO L225 Difference]: With dead ends: 45834 [2024-11-08 15:50:06,026 INFO L226 Difference]: Without dead ends: 20202 [2024-11-08 15:50:06,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:06,045 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 15 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:06,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1699 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20202 states. [2024-11-08 15:50:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20202 to 20202. [2024-11-08 15:50:06,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20202 states, 20197 states have (on average 1.3784720503045007) internal successors, (27841), 20201 states have internal predecessors, (27841), 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-11-08 15:50:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20202 states to 20202 states and 27841 transitions. [2024-11-08 15:50:06,283 INFO L78 Accepts]: Start accepts. Automaton has 20202 states and 27841 transitions. Word has length 153 [2024-11-08 15:50:06,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:06,283 INFO L471 AbstractCegarLoop]: Abstraction has 20202 states and 27841 transitions. [2024-11-08 15:50:06,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-11-08 15:50:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 20202 states and 27841 transitions. [2024-11-08 15:50:06,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 15:50:06,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:06,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:06,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:50:06,300 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:06,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:06,301 INFO L85 PathProgramCache]: Analyzing trace with hash 269300877, now seen corresponding path program 1 times [2024-11-08 15:50:06,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:06,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912836777] [2024-11-08 15:50:06,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:06,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:06,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:06,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912836777] [2024-11-08 15:50:06,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912836777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:06,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:06,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290013510] [2024-11-08 15:50:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:06,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:06,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:06,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:06,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:06,628 INFO L87 Difference]: Start difference. First operand 20202 states and 27841 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-11-08 15:50:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:06,781 INFO L93 Difference]: Finished difference Result 43820 states and 60511 transitions. [2024-11-08 15:50:06,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:06,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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 159 [2024-11-08 15:50:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:06,822 INFO L225 Difference]: With dead ends: 43820 [2024-11-08 15:50:06,822 INFO L226 Difference]: Without dead ends: 26651 [2024-11-08 15:50:06,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:06,846 INFO L432 NwaCegarLoop]: 1224 mSDtfsCounter, 920 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:06,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 2622 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26651 states. [2024-11-08 15:50:07,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26651 to 26394. [2024-11-08 15:50:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26394 states, 26389 states have (on average 1.373488953730721) internal successors, (36245), 26393 states have internal predecessors, (36245), 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-11-08 15:50:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26394 states to 26394 states and 36245 transitions. [2024-11-08 15:50:07,308 INFO L78 Accepts]: Start accepts. Automaton has 26394 states and 36245 transitions. Word has length 159 [2024-11-08 15:50:07,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:07,308 INFO L471 AbstractCegarLoop]: Abstraction has 26394 states and 36245 transitions. [2024-11-08 15:50:07,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-11-08 15:50:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 26394 states and 36245 transitions. [2024-11-08 15:50:07,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 15:50:07,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:07,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:07,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:50:07,334 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:07,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:07,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1314619300, now seen corresponding path program 1 times [2024-11-08 15:50:07,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:07,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530262665] [2024-11-08 15:50:07,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:07,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:07,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:07,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:07,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530262665] [2024-11-08 15:50:07,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530262665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:07,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:07,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:07,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012209216] [2024-11-08 15:50:07,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:07,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:07,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:07,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:07,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:07,410 INFO L87 Difference]: Start difference. First operand 26394 states and 36245 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-11-08 15:50:07,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:07,646 INFO L93 Difference]: Finished difference Result 49342 states and 67925 transitions. [2024-11-08 15:50:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:07,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 160 [2024-11-08 15:50:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:07,692 INFO L225 Difference]: With dead ends: 49342 [2024-11-08 15:50:07,693 INFO L226 Difference]: Without dead ends: 36160 [2024-11-08 15:50:07,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:07,701 INFO L432 NwaCegarLoop]: 931 mSDtfsCounter, 516 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:07,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1472 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:07,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36160 states. [2024-11-08 15:50:08,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36160 to 26394. [2024-11-08 15:50:08,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26394 states, 26389 states have (on average 1.3733373754215772) internal successors, (36241), 26393 states have internal predecessors, (36241), 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-11-08 15:50:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26394 states to 26394 states and 36241 transitions. [2024-11-08 15:50:08,122 INFO L78 Accepts]: Start accepts. Automaton has 26394 states and 36241 transitions. Word has length 160 [2024-11-08 15:50:08,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:08,122 INFO L471 AbstractCegarLoop]: Abstraction has 26394 states and 36241 transitions. [2024-11-08 15:50:08,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-11-08 15:50:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 26394 states and 36241 transitions. [2024-11-08 15:50:08,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 15:50:08,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:08,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:08,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:50:08,139 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:08,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:08,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1351277290, now seen corresponding path program 1 times [2024-11-08 15:50:08,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:08,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085587243] [2024-11-08 15:50:08,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:08,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:08,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:08,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085587243] [2024-11-08 15:50:08,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085587243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:08,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:08,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:08,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783945653] [2024-11-08 15:50:08,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:08,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:08,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:08,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:08,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:08,465 INFO L87 Difference]: Start difference. First operand 26394 states and 36241 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-11-08 15:50:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:08,653 INFO L93 Difference]: Finished difference Result 35318 states and 48621 transitions. [2024-11-08 15:50:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:08,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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 161 [2024-11-08 15:50:08,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:08,689 INFO L225 Difference]: With dead ends: 35318 [2024-11-08 15:50:08,689 INFO L226 Difference]: Without dead ends: 25219 [2024-11-08 15:50:08,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:08,699 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 9 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:08,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1688 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25219 states. [2024-11-08 15:50:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25219 to 25219. [2024-11-08 15:50:08,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25219 states, 25214 states have (on average 1.3749504243674149) internal successors, (34668), 25218 states have internal predecessors, (34668), 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-11-08 15:50:08,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25219 states to 25219 states and 34668 transitions. [2024-11-08 15:50:08,973 INFO L78 Accepts]: Start accepts. Automaton has 25219 states and 34668 transitions. Word has length 161 [2024-11-08 15:50:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:08,973 INFO L471 AbstractCegarLoop]: Abstraction has 25219 states and 34668 transitions. [2024-11-08 15:50:08,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-11-08 15:50:08,973 INFO L276 IsEmpty]: Start isEmpty. Operand 25219 states and 34668 transitions. [2024-11-08 15:50:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 15:50:08,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:08,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:08,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:50:08,988 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:08,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash 98531594, now seen corresponding path program 1 times [2024-11-08 15:50:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:08,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665120496] [2024-11-08 15:50:08,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:08,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:09,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665120496] [2024-11-08 15:50:09,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665120496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:09,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:09,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:09,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809828447] [2024-11-08 15:50:09,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:09,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:09,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:09,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:09,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:09,067 INFO L87 Difference]: Start difference. First operand 25219 states and 34668 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-11-08 15:50:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:09,507 INFO L93 Difference]: Finished difference Result 71354 states and 98591 transitions. [2024-11-08 15:50:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:09,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 165 [2024-11-08 15:50:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:09,589 INFO L225 Difference]: With dead ends: 71354 [2024-11-08 15:50:09,589 INFO L226 Difference]: Without dead ends: 49052 [2024-11-08 15:50:09,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:09,620 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 457 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:09,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 873 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:50:09,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49052 states. [2024-11-08 15:50:10,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49052 to 48986. [2024-11-08 15:50:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48986 states, 48981 states have (on average 1.3655703231865417) internal successors, (66887), 48985 states have internal predecessors, (66887), 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-11-08 15:50:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48986 states to 48986 states and 66887 transitions. [2024-11-08 15:50:10,619 INFO L78 Accepts]: Start accepts. Automaton has 48986 states and 66887 transitions. Word has length 165 [2024-11-08 15:50:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:10,619 INFO L471 AbstractCegarLoop]: Abstraction has 48986 states and 66887 transitions. [2024-11-08 15:50:10,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-11-08 15:50:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 48986 states and 66887 transitions. [2024-11-08 15:50:10,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 15:50:10,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:10,675 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:10,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 15:50:10,675 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:10,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1608136879, now seen corresponding path program 1 times [2024-11-08 15:50:10,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:10,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888378963] [2024-11-08 15:50:10,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:10,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:11,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:11,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:11,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888378963] [2024-11-08 15:50:11,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888378963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:11,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:11,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 15:50:11,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598350980] [2024-11-08 15:50:11,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:11,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:50:11,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:11,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:50:11,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:50:11,561 INFO L87 Difference]: Start difference. First operand 48986 states and 66887 transitions. Second operand has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 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-11-08 15:50:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:12,116 INFO L93 Difference]: Finished difference Result 63867 states and 90121 transitions. [2024-11-08 15:50:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:12,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 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 165 [2024-11-08 15:50:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:12,237 INFO L225 Difference]: With dead ends: 63867 [2024-11-08 15:50:12,241 INFO L226 Difference]: Without dead ends: 44297 [2024-11-08 15:50:12,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:50:12,258 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 690 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 3191 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:12,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 3191 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:50:12,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44297 states. [2024-11-08 15:50:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44297 to 44295. [2024-11-08 15:50:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44295 states, 44290 states have (on average 1.3358997516369384) internal successors, (59167), 44294 states have internal predecessors, (59167), 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-11-08 15:50:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44295 states to 44295 states and 59167 transitions. [2024-11-08 15:50:13,333 INFO L78 Accepts]: Start accepts. Automaton has 44295 states and 59167 transitions. Word has length 165 [2024-11-08 15:50:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:13,333 INFO L471 AbstractCegarLoop]: Abstraction has 44295 states and 59167 transitions. [2024-11-08 15:50:13,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 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-11-08 15:50:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 44295 states and 59167 transitions. [2024-11-08 15:50:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 15:50:13,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:13,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:13,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 15:50:13,368 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:13,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash -554564590, now seen corresponding path program 1 times [2024-11-08 15:50:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:13,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997420946] [2024-11-08 15:50:13,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:13,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:13,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:13,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997420946] [2024-11-08 15:50:13,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997420946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:13,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:13,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:13,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851248558] [2024-11-08 15:50:13,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:13,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:13,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:13,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:13,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:13,695 INFO L87 Difference]: Start difference. First operand 44295 states and 59167 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-11-08 15:50:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:14,053 INFO L93 Difference]: Finished difference Result 67119 states and 89842 transitions. [2024-11-08 15:50:14,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:50:14,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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 165 [2024-11-08 15:50:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:14,086 INFO L225 Difference]: With dead ends: 67119 [2024-11-08 15:50:14,087 INFO L226 Difference]: Without dead ends: 28683 [2024-11-08 15:50:14,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:50:14,108 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 477 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:14,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1584 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:14,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28683 states. [2024-11-08 15:50:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28683 to 28590. [2024-11-08 15:50:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28590 states, 28585 states have (on average 1.3416477173342662) internal successors, (38351), 28589 states have internal predecessors, (38351), 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-11-08 15:50:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28590 states to 28590 states and 38351 transitions. [2024-11-08 15:50:14,536 INFO L78 Accepts]: Start accepts. Automaton has 28590 states and 38351 transitions. Word has length 165 [2024-11-08 15:50:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:14,537 INFO L471 AbstractCegarLoop]: Abstraction has 28590 states and 38351 transitions. [2024-11-08 15:50:14,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-11-08 15:50:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 28590 states and 38351 transitions. [2024-11-08 15:50:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 15:50:14,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:14,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:14,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 15:50:14,553 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:14,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:14,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1156742285, now seen corresponding path program 1 times [2024-11-08 15:50:14,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:14,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492308164] [2024-11-08 15:50:14,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:14,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:14,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:14,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492308164] [2024-11-08 15:50:14,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492308164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:14,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:14,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:14,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335998425] [2024-11-08 15:50:14,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:14,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:14,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:14,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:14,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:14,612 INFO L87 Difference]: Start difference. First operand 28590 states and 38351 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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-11-08 15:50:14,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:14,921 INFO L93 Difference]: Finished difference Result 75408 states and 102327 transitions. [2024-11-08 15:50:14,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:14,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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 167 [2024-11-08 15:50:14,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:14,985 INFO L225 Difference]: With dead ends: 75408 [2024-11-08 15:50:14,985 INFO L226 Difference]: Without dead ends: 53191 [2024-11-08 15:50:15,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:15,017 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 435 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:15,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 907 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:50:15,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53191 states. [2024-11-08 15:50:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53191 to 53137. [2024-11-08 15:50:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53137 states, 53132 states have (on average 1.3408868478506362) internal successors, (71244), 53136 states have internal predecessors, (71244), 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-11-08 15:50:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53137 states to 53137 states and 71244 transitions. [2024-11-08 15:50:15,896 INFO L78 Accepts]: Start accepts. Automaton has 53137 states and 71244 transitions. Word has length 167 [2024-11-08 15:50:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:15,897 INFO L471 AbstractCegarLoop]: Abstraction has 53137 states and 71244 transitions. [2024-11-08 15:50:15,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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-11-08 15:50:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 53137 states and 71244 transitions. [2024-11-08 15:50:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 15:50:15,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:15,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:15,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 15:50:15,943 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:15,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:15,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1293957512, now seen corresponding path program 1 times [2024-11-08 15:50:15,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:15,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964018876] [2024-11-08 15:50:15,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:15,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:16,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:16,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964018876] [2024-11-08 15:50:16,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964018876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:16,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:16,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:16,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855093009] [2024-11-08 15:50:16,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:16,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:16,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:16,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:16,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:16,236 INFO L87 Difference]: Start difference. First operand 53137 states and 71244 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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-11-08 15:50:16,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:16,955 INFO L93 Difference]: Finished difference Result 112174 states and 150586 transitions. [2024-11-08 15:50:16,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:16,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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 167 [2024-11-08 15:50:16,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:17,032 INFO L225 Difference]: With dead ends: 112174 [2024-11-08 15:50:17,032 INFO L226 Difference]: Without dead ends: 73484 [2024-11-08 15:50:17,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:17,066 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 1035 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:17,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1874 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:17,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73484 states. [2024-11-08 15:50:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73484 to 53329. [2024-11-08 15:50:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53329 states, 53324 states have (on average 1.3403720651113944) internal successors, (71474), 53328 states have internal predecessors, (71474), 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-11-08 15:50:17,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53329 states to 53329 states and 71474 transitions. [2024-11-08 15:50:17,892 INFO L78 Accepts]: Start accepts. Automaton has 53329 states and 71474 transitions. Word has length 167 [2024-11-08 15:50:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:17,894 INFO L471 AbstractCegarLoop]: Abstraction has 53329 states and 71474 transitions. [2024-11-08 15:50:17,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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-11-08 15:50:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 53329 states and 71474 transitions. [2024-11-08 15:50:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 15:50:17,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:17,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 15:50:17,922 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:17,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:17,922 INFO L85 PathProgramCache]: Analyzing trace with hash -119597428, now seen corresponding path program 1 times [2024-11-08 15:50:17,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:17,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376870685] [2024-11-08 15:50:17,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:17,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:17,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:17,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376870685] [2024-11-08 15:50:17,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376870685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:17,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:17,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:17,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370316920] [2024-11-08 15:50:17,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:17,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:17,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:17,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:17,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:17,988 INFO L87 Difference]: Start difference. First operand 53329 states and 71474 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-11-08 15:50:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:18,429 INFO L93 Difference]: Finished difference Result 106066 states and 142259 transitions. [2024-11-08 15:50:18,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:18,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 168 [2024-11-08 15:50:18,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:18,487 INFO L225 Difference]: With dead ends: 106066 [2024-11-08 15:50:18,488 INFO L226 Difference]: Without dead ends: 53345 [2024-11-08 15:50:18,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:18,514 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 0 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:18,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1082 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:18,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53345 states. [2024-11-08 15:50:19,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53345 to 53345. [2024-11-08 15:50:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53345 states, 53340 states have (on average 1.3402699662542181) internal successors, (71490), 53344 states have internal predecessors, (71490), 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-11-08 15:50:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53345 states to 53345 states and 71490 transitions. [2024-11-08 15:50:19,273 INFO L78 Accepts]: Start accepts. Automaton has 53345 states and 71490 transitions. Word has length 168 [2024-11-08 15:50:19,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:19,273 INFO L471 AbstractCegarLoop]: Abstraction has 53345 states and 71490 transitions. [2024-11-08 15:50:19,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-11-08 15:50:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 53345 states and 71490 transitions. [2024-11-08 15:50:19,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 15:50:19,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:19,356 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:19,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 15:50:19,359 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:19,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash 414006733, now seen corresponding path program 1 times [2024-11-08 15:50:19,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:19,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384996447] [2024-11-08 15:50:19,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:19,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:19,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:19,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384996447] [2024-11-08 15:50:19,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384996447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:19,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:19,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:19,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37219086] [2024-11-08 15:50:19,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:19,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:50:19,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:19,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:50:19,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:50:19,627 INFO L87 Difference]: Start difference. First operand 53345 states and 71490 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 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-11-08 15:50:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:19,985 INFO L93 Difference]: Finished difference Result 87414 states and 118476 transitions. [2024-11-08 15:50:19,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:50:19,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 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 169 [2024-11-08 15:50:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:20,039 INFO L225 Difference]: With dead ends: 87414 [2024-11-08 15:50:20,039 INFO L226 Difference]: Without dead ends: 37340 [2024-11-08 15:50:20,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:50:20,078 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 1453 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:20,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 495 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:20,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37340 states. [2024-11-08 15:50:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37340 to 28756. [2024-11-08 15:50:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28756 states, 28751 states have (on average 1.3238843866300303) internal successors, (38063), 28755 states have internal predecessors, (38063), 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-11-08 15:50:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28756 states to 28756 states and 38063 transitions. [2024-11-08 15:50:20,739 INFO L78 Accepts]: Start accepts. Automaton has 28756 states and 38063 transitions. Word has length 169 [2024-11-08 15:50:20,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:20,739 INFO L471 AbstractCegarLoop]: Abstraction has 28756 states and 38063 transitions. [2024-11-08 15:50:20,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 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-11-08 15:50:20,739 INFO L276 IsEmpty]: Start isEmpty. Operand 28756 states and 38063 transitions. [2024-11-08 15:50:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 15:50:20,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:20,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:20,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 15:50:20,754 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:20,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1444044968, now seen corresponding path program 1 times [2024-11-08 15:50:20,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:20,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972235086] [2024-11-08 15:50:20,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:20,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:20,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:20,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972235086] [2024-11-08 15:50:20,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972235086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:20,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:20,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:20,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176524674] [2024-11-08 15:50:20,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:20,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:20,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:20,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:20,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:20,985 INFO L87 Difference]: Start difference. First operand 28756 states and 38063 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-11-08 15:50:21,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:21,148 INFO L93 Difference]: Finished difference Result 52674 states and 71264 transitions. [2024-11-08 15:50:21,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:21,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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 169 [2024-11-08 15:50:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:21,351 INFO L225 Difference]: With dead ends: 52674 [2024-11-08 15:50:21,351 INFO L226 Difference]: Without dead ends: 41243 [2024-11-08 15:50:21,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:21,360 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 852 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:21,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 936 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41243 states. [2024-11-08 15:50:21,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41243 to 41241. [2024-11-08 15:50:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41241 states, 41236 states have (on average 1.3044427199534387) internal successors, (53790), 41240 states have internal predecessors, (53790), 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-11-08 15:50:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41241 states to 41241 states and 53790 transitions. [2024-11-08 15:50:21,778 INFO L78 Accepts]: Start accepts. Automaton has 41241 states and 53790 transitions. Word has length 169 [2024-11-08 15:50:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:21,778 INFO L471 AbstractCegarLoop]: Abstraction has 41241 states and 53790 transitions. [2024-11-08 15:50:21,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-11-08 15:50:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 41241 states and 53790 transitions. [2024-11-08 15:50:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 15:50:21,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:21,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:21,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 15:50:21,802 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:21,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:21,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1157430736, now seen corresponding path program 1 times [2024-11-08 15:50:21,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:21,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121564590] [2024-11-08 15:50:21,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:21,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:22,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:22,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121564590] [2024-11-08 15:50:22,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121564590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:22,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:22,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:22,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943435906] [2024-11-08 15:50:22,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:22,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:22,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:22,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:22,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:22,147 INFO L87 Difference]: Start difference. First operand 41241 states and 53790 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-11-08 15:50:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:22,298 INFO L93 Difference]: Finished difference Result 71823 states and 93725 transitions. [2024-11-08 15:50:22,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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 169 [2024-11-08 15:50:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:22,341 INFO L225 Difference]: With dead ends: 71823 [2024-11-08 15:50:22,342 INFO L226 Difference]: Without dead ends: 41966 [2024-11-08 15:50:22,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:22,368 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 472 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:22,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1856 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41966 states. [2024-11-08 15:50:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41966 to 41561. [2024-11-08 15:50:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41561 states, 41556 states have (on average 1.303181249398402) internal successors, (54155), 41560 states have internal predecessors, (54155), 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-11-08 15:50:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41561 states to 41561 states and 54155 transitions. [2024-11-08 15:50:23,051 INFO L78 Accepts]: Start accepts. Automaton has 41561 states and 54155 transitions. Word has length 169 [2024-11-08 15:50:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:23,051 INFO L471 AbstractCegarLoop]: Abstraction has 41561 states and 54155 transitions. [2024-11-08 15:50:23,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-11-08 15:50:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 41561 states and 54155 transitions. [2024-11-08 15:50:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 15:50:23,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:23,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:23,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 15:50:23,082 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:23,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:23,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1236291671, now seen corresponding path program 1 times [2024-11-08 15:50:23,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:23,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969825417] [2024-11-08 15:50:23,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:23,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:23,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:23,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969825417] [2024-11-08 15:50:23,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969825417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:23,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:23,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:50:23,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283474699] [2024-11-08 15:50:23,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:23,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:50:23,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:23,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:50:23,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:23,430 INFO L87 Difference]: Start difference. First operand 41561 states and 54155 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-11-08 15:50:23,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:23,602 INFO L93 Difference]: Finished difference Result 77231 states and 100650 transitions. [2024-11-08 15:50:23,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:50:23,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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 169 [2024-11-08 15:50:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:23,651 INFO L225 Difference]: With dead ends: 77231 [2024-11-08 15:50:23,652 INFO L226 Difference]: Without dead ends: 35970 [2024-11-08 15:50:23,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:50:23,685 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 4 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:23,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1642 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35970 states. [2024-11-08 15:50:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35970 to 35970. [2024-11-08 15:50:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35970 states, 35965 states have (on average 1.302599749756708) internal successors, (46848), 35969 states have internal predecessors, (46848), 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-11-08 15:50:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35970 states to 35970 states and 46848 transitions. [2024-11-08 15:50:24,418 INFO L78 Accepts]: Start accepts. Automaton has 35970 states and 46848 transitions. Word has length 169 [2024-11-08 15:50:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:24,422 INFO L471 AbstractCegarLoop]: Abstraction has 35970 states and 46848 transitions. [2024-11-08 15:50:24,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-11-08 15:50:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 35970 states and 46848 transitions. [2024-11-08 15:50:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 15:50:24,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:24,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:24,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 15:50:24,467 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:24,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash 362923219, now seen corresponding path program 1 times [2024-11-08 15:50:24,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:24,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560863278] [2024-11-08 15:50:24,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:24,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:24,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:24,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560863278] [2024-11-08 15:50:24,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560863278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:24,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:24,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:24,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978860396] [2024-11-08 15:50:24,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:24,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:24,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:24,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:24,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:24,525 INFO L87 Difference]: Start difference. First operand 35970 states and 46848 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-11-08 15:50:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:24,652 INFO L93 Difference]: Finished difference Result 78163 states and 101815 transitions. [2024-11-08 15:50:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:24,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 170 [2024-11-08 15:50:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:24,713 INFO L225 Difference]: With dead ends: 78163 [2024-11-08 15:50:24,713 INFO L226 Difference]: Without dead ends: 52302 [2024-11-08 15:50:24,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:24,745 INFO L432 NwaCegarLoop]: 949 mSDtfsCounter, 490 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:24,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1479 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:50:24,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52302 states. [2024-11-08 15:50:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52302 to 35973. [2024-11-08 15:50:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35973 states, 35968 states have (on average 1.3024076957295374) internal successors, (46845), 35972 states have internal predecessors, (46845), 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-11-08 15:50:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35973 states to 35973 states and 46845 transitions. [2024-11-08 15:50:25,593 INFO L78 Accepts]: Start accepts. Automaton has 35973 states and 46845 transitions. Word has length 170 [2024-11-08 15:50:25,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:25,594 INFO L471 AbstractCegarLoop]: Abstraction has 35973 states and 46845 transitions. [2024-11-08 15:50:25,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-11-08 15:50:25,594 INFO L276 IsEmpty]: Start isEmpty. Operand 35973 states and 46845 transitions. [2024-11-08 15:50:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 15:50:25,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:25,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:25,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 15:50:25,618 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:25,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:25,618 INFO L85 PathProgramCache]: Analyzing trace with hash -855174734, now seen corresponding path program 1 times [2024-11-08 15:50:25,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:25,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769609033] [2024-11-08 15:50:25,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:25,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:27,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:27,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:27,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769609033] [2024-11-08 15:50:27,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769609033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:27,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:27,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-08 15:50:27,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626247578] [2024-11-08 15:50:27,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:27,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 15:50:27,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:27,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 15:50:27,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2024-11-08 15:50:27,691 INFO L87 Difference]: Start difference. First operand 35973 states and 46845 transitions. Second operand has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 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-11-08 15:50:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:32,449 INFO L93 Difference]: Finished difference Result 54565 states and 73501 transitions. [2024-11-08 15:50:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 15:50:32,449 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 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 171 [2024-11-08 15:50:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:32,510 INFO L225 Difference]: With dead ends: 54565 [2024-11-08 15:50:32,510 INFO L226 Difference]: Without dead ends: 50145 [2024-11-08 15:50:32,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=399, Invalid=1407, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 15:50:32,522 INFO L432 NwaCegarLoop]: 950 mSDtfsCounter, 5993 mSDsluCounter, 13121 mSDsCounter, 0 mSdLazyCounter, 4699 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5993 SdHoareTripleChecker+Valid, 14071 SdHoareTripleChecker+Invalid, 4773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 4699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:32,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5993 Valid, 14071 Invalid, 4773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 4699 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 15:50:32,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50145 states. [2024-11-08 15:50:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50145 to 37339. [2024-11-08 15:50:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37339 states, 37334 states have (on average 1.2981196764343494) internal successors, (48464), 37338 states have internal predecessors, (48464), 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-11-08 15:50:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37339 states to 37339 states and 48464 transitions. [2024-11-08 15:50:33,000 INFO L78 Accepts]: Start accepts. Automaton has 37339 states and 48464 transitions. Word has length 171 [2024-11-08 15:50:33,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:33,000 INFO L471 AbstractCegarLoop]: Abstraction has 37339 states and 48464 transitions. [2024-11-08 15:50:33,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 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-11-08 15:50:33,000 INFO L276 IsEmpty]: Start isEmpty. Operand 37339 states and 48464 transitions. [2024-11-08 15:50:33,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 15:50:33,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:33,024 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:33,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 15:50:33,025 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:33,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:33,025 INFO L85 PathProgramCache]: Analyzing trace with hash -176781235, now seen corresponding path program 1 times [2024-11-08 15:50:33,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:33,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763241848] [2024-11-08 15:50:33,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:33,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:33,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:33,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763241848] [2024-11-08 15:50:33,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763241848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:33,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:33,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 15:50:33,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782838452] [2024-11-08 15:50:33,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:33,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 15:50:33,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:33,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 15:50:33,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:50:33,395 INFO L87 Difference]: Start difference. First operand 37339 states and 48464 transitions. Second operand has 10 states, 10 states have (on average 17.1) internal successors, (171), 9 states have internal predecessors, (171), 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-11-08 15:50:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:33,614 INFO L93 Difference]: Finished difference Result 60997 states and 80239 transitions. [2024-11-08 15:50:33,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:50:33,615 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 9 states have internal predecessors, (171), 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 171 [2024-11-08 15:50:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:33,641 INFO L225 Difference]: With dead ends: 60997 [2024-11-08 15:50:33,641 INFO L226 Difference]: Without dead ends: 25914 [2024-11-08 15:50:33,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:50:33,663 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 1427 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:33,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 728 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25914 states. [2024-11-08 15:50:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25914 to 20355. [2024-11-08 15:50:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20355 states, 20350 states have (on average 1.282014742014742) internal successors, (26089), 20354 states have internal predecessors, (26089), 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-11-08 15:50:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20355 states to 20355 states and 26089 transitions. [2024-11-08 15:50:33,890 INFO L78 Accepts]: Start accepts. Automaton has 20355 states and 26089 transitions. Word has length 171 [2024-11-08 15:50:33,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:33,890 INFO L471 AbstractCegarLoop]: Abstraction has 20355 states and 26089 transitions. [2024-11-08 15:50:33,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 9 states have internal predecessors, (171), 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-11-08 15:50:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 20355 states and 26089 transitions. [2024-11-08 15:50:33,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 15:50:33,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:33,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:33,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 15:50:33,902 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:33,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:33,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1795637352, now seen corresponding path program 1 times [2024-11-08 15:50:33,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:33,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601539228] [2024-11-08 15:50:33,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:33,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:35,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:35,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601539228] [2024-11-08 15:50:35,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601539228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:35,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:35,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-08 15:50:35,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400681730] [2024-11-08 15:50:35,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:35,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 15:50:35,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:35,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 15:50:35,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:50:35,575 INFO L87 Difference]: Start difference. First operand 20355 states and 26089 transitions. Second operand has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 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-11-08 15:50:40,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:40,527 INFO L93 Difference]: Finished difference Result 32688 states and 43444 transitions. [2024-11-08 15:50:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 15:50:40,527 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 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 171 [2024-11-08 15:50:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:40,557 INFO L225 Difference]: With dead ends: 32688 [2024-11-08 15:50:40,557 INFO L226 Difference]: Without dead ends: 31376 [2024-11-08 15:50:40,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=496, Invalid=1760, Unknown=0, NotChecked=0, Total=2256 [2024-11-08 15:50:40,563 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 4700 mSDsluCounter, 13735 mSDsCounter, 0 mSdLazyCounter, 4878 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4700 SdHoareTripleChecker+Valid, 14781 SdHoareTripleChecker+Invalid, 4958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:40,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4700 Valid, 14781 Invalid, 4958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4878 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 15:50:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31376 states. [2024-11-08 15:50:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31376 to 22200. [2024-11-08 15:50:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22200 states, 22195 states have (on average 1.2748366749267852) internal successors, (28295), 22199 states have internal predecessors, (28295), 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-11-08 15:50:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22200 states to 22200 states and 28295 transitions. [2024-11-08 15:50:40,822 INFO L78 Accepts]: Start accepts. Automaton has 22200 states and 28295 transitions. Word has length 171 [2024-11-08 15:50:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:40,823 INFO L471 AbstractCegarLoop]: Abstraction has 22200 states and 28295 transitions. [2024-11-08 15:50:40,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 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-11-08 15:50:40,823 INFO L276 IsEmpty]: Start isEmpty. Operand 22200 states and 28295 transitions. [2024-11-08 15:50:40,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 15:50:40,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:40,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:40,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 15:50:40,836 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:40,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:40,837 INFO L85 PathProgramCache]: Analyzing trace with hash 367317059, now seen corresponding path program 1 times [2024-11-08 15:50:40,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:40,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983838705] [2024-11-08 15:50:40,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:40,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:40,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:40,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983838705] [2024-11-08 15:50:40,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983838705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:40,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:40,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:50:40,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845017205] [2024-11-08 15:50:40,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:40,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:50:40,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:40,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:50:40,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:40,903 INFO L87 Difference]: Start difference. First operand 22200 states and 28295 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-11-08 15:50:41,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:41,132 INFO L93 Difference]: Finished difference Result 52519 states and 68017 transitions. [2024-11-08 15:50:41,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:50:41,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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 171 [2024-11-08 15:50:41,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:41,172 INFO L225 Difference]: With dead ends: 52519 [2024-11-08 15:50:41,173 INFO L226 Difference]: Without dead ends: 38204 [2024-11-08 15:50:41,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:50:41,191 INFO L432 NwaCegarLoop]: 602 mSDtfsCounter, 343 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:41,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1003 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:50:41,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38204 states. [2024-11-08 15:50:41,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38204 to 37686. [2024-11-08 15:50:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37686 states, 37681 states have (on average 1.2770892492237467) internal successors, (48122), 37685 states have internal predecessors, (48122), 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-11-08 15:50:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37686 states to 37686 states and 48122 transitions. [2024-11-08 15:50:41,714 INFO L78 Accepts]: Start accepts. Automaton has 37686 states and 48122 transitions. Word has length 171 [2024-11-08 15:50:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:41,714 INFO L471 AbstractCegarLoop]: Abstraction has 37686 states and 48122 transitions. [2024-11-08 15:50:41,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-11-08 15:50:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 37686 states and 48122 transitions. [2024-11-08 15:50:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 15:50:41,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:41,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 15:50:41,737 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:41,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1127609204, now seen corresponding path program 1 times [2024-11-08 15:50:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:41,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244954479] [2024-11-08 15:50:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:41,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:43,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:43,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:43,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244954479] [2024-11-08 15:50:43,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244954479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:43,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:43,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-08 15:50:43,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131796344] [2024-11-08 15:50:43,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:43,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 15:50:43,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:43,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 15:50:43,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:50:43,446 INFO L87 Difference]: Start difference. First operand 37686 states and 48122 transitions. Second operand has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 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-11-08 15:50:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:47,995 INFO L93 Difference]: Finished difference Result 67970 states and 91703 transitions. [2024-11-08 15:50:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 15:50:47,995 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 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 171 [2024-11-08 15:50:47,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:48,068 INFO L225 Difference]: With dead ends: 67970 [2024-11-08 15:50:48,069 INFO L226 Difference]: Without dead ends: 63161 [2024-11-08 15:50:48,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=355, Invalid=1127, Unknown=0, NotChecked=0, Total=1482 [2024-11-08 15:50:48,094 INFO L432 NwaCegarLoop]: 1155 mSDtfsCounter, 6106 mSDsluCounter, 13742 mSDsCounter, 0 mSdLazyCounter, 4814 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6106 SdHoareTripleChecker+Valid, 14897 SdHoareTripleChecker+Invalid, 4831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:48,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6106 Valid, 14897 Invalid, 4831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4814 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 15:50:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63161 states. [2024-11-08 15:50:48,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63161 to 38418. [2024-11-08 15:50:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38418 states, 38413 states have (on average 1.2749850311092599) internal successors, (48976), 38417 states have internal predecessors, (48976), 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-11-08 15:50:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38418 states to 38418 states and 48976 transitions. [2024-11-08 15:50:48,665 INFO L78 Accepts]: Start accepts. Automaton has 38418 states and 48976 transitions. Word has length 171 [2024-11-08 15:50:48,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:48,670 INFO L471 AbstractCegarLoop]: Abstraction has 38418 states and 48976 transitions. [2024-11-08 15:50:48,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 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-11-08 15:50:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 38418 states and 48976 transitions. [2024-11-08 15:50:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 15:50:48,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:48,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:48,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 15:50:48,697 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:48,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:48,697 INFO L85 PathProgramCache]: Analyzing trace with hash 416227804, now seen corresponding path program 1 times [2024-11-08 15:50:48,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:48,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914438650] [2024-11-08 15:50:48,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:48,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:49,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:49,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914438650] [2024-11-08 15:50:49,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914438650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:49,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:49,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 15:50:49,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42465935] [2024-11-08 15:50:49,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:49,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 15:50:49,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:49,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 15:50:49,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:50:49,583 INFO L87 Difference]: Start difference. First operand 38418 states and 48976 transitions. Second operand has 16 states, 16 states have (on average 10.6875) internal successors, (171), 16 states have internal predecessors, (171), 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-11-08 15:50:51,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:51,314 INFO L93 Difference]: Finished difference Result 105045 states and 140855 transitions. [2024-11-08 15:50:51,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-08 15:50:51,315 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.6875) internal successors, (171), 16 states have internal predecessors, (171), 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 171 [2024-11-08 15:50:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:51,423 INFO L225 Difference]: With dead ends: 105045 [2024-11-08 15:50:51,424 INFO L226 Difference]: Without dead ends: 96768 [2024-11-08 15:50:51,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=445, Invalid=1277, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 15:50:51,460 INFO L432 NwaCegarLoop]: 1084 mSDtfsCounter, 5761 mSDsluCounter, 8949 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5761 SdHoareTripleChecker+Valid, 10033 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:51,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5761 Valid, 10033 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 15:50:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96768 states. [2024-11-08 15:50:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96768 to 45872. [2024-11-08 15:50:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45872 states, 45867 states have (on average 1.2551071576514705) internal successors, (57568), 45871 states have internal predecessors, (57568), 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-11-08 15:50:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45872 states to 45872 states and 57568 transitions. [2024-11-08 15:50:52,367 INFO L78 Accepts]: Start accepts. Automaton has 45872 states and 57568 transitions. Word has length 171 [2024-11-08 15:50:52,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:52,368 INFO L471 AbstractCegarLoop]: Abstraction has 45872 states and 57568 transitions. [2024-11-08 15:50:52,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.6875) internal successors, (171), 16 states have internal predecessors, (171), 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-11-08 15:50:52,368 INFO L276 IsEmpty]: Start isEmpty. Operand 45872 states and 57568 transitions. [2024-11-08 15:50:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 15:50:52,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:52,405 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:50:52,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 15:50:52,405 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 15:50:52,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:52,406 INFO L85 PathProgramCache]: Analyzing trace with hash 899792804, now seen corresponding path program 1 times [2024-11-08 15:50:52,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:52,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118486650] [2024-11-08 15:50:52,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:52,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:54,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:54,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118486650] [2024-11-08 15:50:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118486650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:54,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:54,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-08 15:50:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417806835] [2024-11-08 15:50:54,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:54,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 15:50:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:54,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 15:50:54,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2024-11-08 15:50:54,553 INFO L87 Difference]: Start difference. First operand 45872 states and 57568 transitions. Second operand has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 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)