./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-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 c9fed3b6ecd1551705440e8c2971862b3f83812db515b8181a20d7126e9055f8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:32:29,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:32:29,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:32:29,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:32:29,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:32:29,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:32:29,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:32:29,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:32:29,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:32:29,473 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:32:29,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:32:29,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:32:29,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:32:29,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:32:29,479 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:32:29,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:32:29,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:32:29,480 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:32:29,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:32:29,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:32:29,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:32:29,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:32:29,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:32:29,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:32:29,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:32:29,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:32:29,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:32:29,484 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:32:29,485 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:32:29,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:32:29,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:32:29,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:32:29,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:32:29,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:32:29,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:32:29,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:32:29,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:32:29,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:32:29,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:32:29,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:32:29,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:32:29,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:32:29,489 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 -> c9fed3b6ecd1551705440e8c2971862b3f83812db515b8181a20d7126e9055f8 [2024-11-11 21:32:29,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:32:29,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:32:29,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:32:29,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:32:29,782 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:32:29,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-11-11 21:32:31,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:32:31,631 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:32:31,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-11-11 21:32:31,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b54e6e3/ddac41775282448497e2a7f49711e44a/FLAGac5e173f1 [2024-11-11 21:32:31,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b54e6e3/ddac41775282448497e2a7f49711e44a [2024-11-11 21:32:31,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:32:31,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:32:31,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:32:31,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:32:31,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:32:31,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:32:31" (1/1) ... [2024-11-11 21:32:31,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dabc326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:32:31, skipping insertion in model container [2024-11-11 21:32:31,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:32:31" (1/1) ... [2024-11-11 21:32:31,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:32:32,326 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_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[7186,7199] [2024-11-11 21:32:32,361 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_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11327,11340] [2024-11-11 21:32:32,412 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_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[18377,18390] [2024-11-11 21:32:32,448 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_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[24849,24862] [2024-11-11 21:32:32,532 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_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[43924,43937] [2024-11-11 21:32:32,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_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[71846,71859] [2024-11-11 21:32:32,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:32:32,804 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:32:32,838 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_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[7186,7199] [2024-11-11 21:32:32,845 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_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11327,11340] [2024-11-11 21:32:32,859 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_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[18377,18390] [2024-11-11 21:32:32,871 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_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[24849,24862] [2024-11-11 21:32:32,903 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_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[43924,43937] [2024-11-11 21:32:32,944 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_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[71846,71859] [2024-11-11 21:32:33,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:32:33,054 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:32:33,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:32:33 WrapperNode [2024-11-11 21:32:33,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:32:33,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:32:33,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:32:33,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:32:33,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:32:33" (1/1) ... [2024-11-11 21:32:33,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:32:33" (1/1) ... [2024-11-11 21:32:33,224 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6061 [2024-11-11 21:32:33,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:32:33,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:32:33,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:32:33,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:32:33,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:32:33" (1/1) ... [2024-11-11 21:32:33,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:32:33" (1/1) ... [2024-11-11 21:32:33,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:32:33" (1/1) ... [2024-11-11 21:32:33,337 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-11 21:32:33,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:32:33" (1/1) ... [2024-11-11 21:32:33,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:32:33" (1/1) ... [2024-11-11 21:32:33,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:32:33" (1/1) ... [2024-11-11 21:32:33,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:32:33" (1/1) ... [2024-11-11 21:32:33,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:32:33" (1/1) ... [2024-11-11 21:32:33,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:32:33" (1/1) ... [2024-11-11 21:32:33,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:32:33,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:32:33,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:32:33,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:32:33,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:32:33" (1/1) ... [2024-11-11 21:32:33,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:32:33,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:32:33,605 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-11 21:32:33,608 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-11 21:32:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:32:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:32:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:32:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:32:33,957 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:32:33,959 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:32:36,929 INFO L? ?]: Removed 1041 outVars from TransFormulas that were not future-live. [2024-11-11 21:32:36,929 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:32:36,982 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:32:36,982 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:32:36,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:32:36 BoogieIcfgContainer [2024-11-11 21:32:36,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:32:36,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:32:36,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:32:36,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:32:36,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:32:31" (1/3) ... [2024-11-11 21:32:36,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352e9b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:32:36, skipping insertion in model container [2024-11-11 21:32:36,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:32:33" (2/3) ... [2024-11-11 21:32:36,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352e9b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:32:36, skipping insertion in model container [2024-11-11 21:32:36,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:32:36" (3/3) ... [2024-11-11 21:32:36,993 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-11-11 21:32:37,009 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:32:37,010 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-11 21:32:37,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:32:37,130 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;@7d99b576, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:32:37,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-11 21:32:37,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 1254 states, 1247 states have (on average 1.8043303929430634) internal successors, (2250), 1253 states have internal predecessors, (2250), 0 states have call successors, (0), 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-11 21:32:37,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 21:32:37,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:37,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:37,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:37,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:37,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1061871762, now seen corresponding path program 1 times [2024-11-11 21:32:37,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:37,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075142101] [2024-11-11 21:32:37,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:37,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:37,863 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-11 21:32:37,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:37,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075142101] [2024-11-11 21:32:37,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075142101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:37,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:37,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:32:37,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486542079] [2024-11-11 21:32:37,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:37,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:32:37,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:37,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:32:37,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:32:37,903 INFO L87 Difference]: Start difference. First operand has 1254 states, 1247 states have (on average 1.8043303929430634) internal successors, (2250), 1253 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:39,493 INFO L93 Difference]: Finished difference Result 2475 states and 4331 transitions. [2024-11-11 21:32:39,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:32:39,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-11 21:32:39,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:39,526 INFO L225 Difference]: With dead ends: 2475 [2024-11-11 21:32:39,527 INFO L226 Difference]: Without dead ends: 1558 [2024-11-11 21:32:39,537 INFO L434 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-11 21:32:39,540 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 7059 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7059 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:39,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7059 Valid, 1499 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 21:32:39,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2024-11-11 21:32:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1552. [2024-11-11 21:32:39,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1546 states have (on average 1.3544631306597672) internal successors, (2094), 1551 states have internal predecessors, (2094), 0 states have call successors, (0), 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-11 21:32:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2094 transitions. [2024-11-11 21:32:39,659 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2094 transitions. Word has length 51 [2024-11-11 21:32:39,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:39,691 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 2094 transitions. [2024-11-11 21:32:39,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:39,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2094 transitions. [2024-11-11 21:32:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:32:39,695 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:39,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:39,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:32:39,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:39,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:39,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1625759521, now seen corresponding path program 1 times [2024-11-11 21:32:39,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:39,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943628267] [2024-11-11 21:32:39,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:39,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:39,878 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-11 21:32:39,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:39,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943628267] [2024-11-11 21:32:39,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943628267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:39,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:39,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:32:39,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567013420] [2024-11-11 21:32:39,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:39,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:32:39,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:39,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:32:39,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:32:39,882 INFO L87 Difference]: Start difference. First operand 1552 states and 2094 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:40,886 INFO L93 Difference]: Finished difference Result 3181 states and 4350 transitions. [2024-11-11 21:32:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:32:40,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-11 21:32:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:40,896 INFO L225 Difference]: With dead ends: 3181 [2024-11-11 21:32:40,896 INFO L226 Difference]: Without dead ends: 2197 [2024-11-11 21:32:40,898 INFO L434 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-11 21:32:40,900 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 5058 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5058 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:40,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5058 Valid, 1030 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 21:32:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2024-11-11 21:32:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 2185. [2024-11-11 21:32:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2185 states, 2179 states have (on average 1.3740247820100964) internal successors, (2994), 2184 states have internal predecessors, (2994), 0 states have call successors, (0), 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-11 21:32:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 2994 transitions. [2024-11-11 21:32:40,949 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 2994 transitions. Word has length 52 [2024-11-11 21:32:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:40,950 INFO L471 AbstractCegarLoop]: Abstraction has 2185 states and 2994 transitions. [2024-11-11 21:32:40,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:40,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2994 transitions. [2024-11-11 21:32:40,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:32:40,953 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:40,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:40,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:32:40,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:40,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:40,955 INFO L85 PathProgramCache]: Analyzing trace with hash 299183278, now seen corresponding path program 1 times [2024-11-11 21:32:40,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:40,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504061962] [2024-11-11 21:32:40,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:40,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:41,119 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-11 21:32:41,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:41,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504061962] [2024-11-11 21:32:41,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504061962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:41,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:41,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:32:41,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552761297] [2024-11-11 21:32:41,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:41,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:32:41,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:41,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:32:41,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:32:41,122 INFO L87 Difference]: Start difference. First operand 2185 states and 2994 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:42,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:42,079 INFO L93 Difference]: Finished difference Result 4530 states and 6290 transitions. [2024-11-11 21:32:42,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:32:42,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-11 21:32:42,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:42,092 INFO L225 Difference]: With dead ends: 4530 [2024-11-11 21:32:42,093 INFO L226 Difference]: Without dead ends: 3051 [2024-11-11 21:32:42,097 INFO L434 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-11 21:32:42,099 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 4477 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4477 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:42,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4477 Valid, 884 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 21:32:42,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2024-11-11 21:32:42,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 3041. [2024-11-11 21:32:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3035 states have (on average 1.3759472817133442) internal successors, (4176), 3040 states have internal predecessors, (4176), 0 states have call successors, (0), 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-11 21:32:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4176 transitions. [2024-11-11 21:32:42,188 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4176 transitions. Word has length 52 [2024-11-11 21:32:42,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:42,189 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 4176 transitions. [2024-11-11 21:32:42,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4176 transitions. [2024-11-11 21:32:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 21:32:42,194 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:42,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:42,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:32:42,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:42,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash 448762372, now seen corresponding path program 1 times [2024-11-11 21:32:42,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:42,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059541022] [2024-11-11 21:32:42,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:42,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:42,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-11 21:32:42,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:42,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059541022] [2024-11-11 21:32:42,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059541022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:42,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:42,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:32:42,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834446333] [2024-11-11 21:32:42,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:42,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:32:42,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:42,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:32:42,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:32:42,576 INFO L87 Difference]: Start difference. First operand 3041 states and 4176 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:44,418 INFO L93 Difference]: Finished difference Result 5165 states and 7240 transitions. [2024-11-11 21:32:44,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:32:44,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-11 21:32:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:44,433 INFO L225 Difference]: With dead ends: 5165 [2024-11-11 21:32:44,433 INFO L226 Difference]: Without dead ends: 4608 [2024-11-11 21:32:44,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:32:44,437 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 4076 mSDsluCounter, 2117 mSDsCounter, 0 mSdLazyCounter, 3061 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4076 SdHoareTripleChecker+Valid, 2771 SdHoareTripleChecker+Invalid, 3134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 3061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:44,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4076 Valid, 2771 Invalid, 3134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 3061 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 21:32:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2024-11-11 21:32:44,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 3041. [2024-11-11 21:32:44,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3035 states have (on average 1.3756177924217463) internal successors, (4175), 3040 states have internal predecessors, (4175), 0 states have call successors, (0), 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-11 21:32:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4175 transitions. [2024-11-11 21:32:44,529 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4175 transitions. Word has length 53 [2024-11-11 21:32:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:44,529 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 4175 transitions. [2024-11-11 21:32:44,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4175 transitions. [2024-11-11 21:32:44,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 21:32:44,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:44,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:44,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:32:44,535 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:44,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:44,535 INFO L85 PathProgramCache]: Analyzing trace with hash 303472925, now seen corresponding path program 1 times [2024-11-11 21:32:44,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:44,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129754160] [2024-11-11 21:32:44,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:44,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:44,880 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-11 21:32:44,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:44,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129754160] [2024-11-11 21:32:44,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129754160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:44,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:44,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:32:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803403646] [2024-11-11 21:32:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:44,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:32:44,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:44,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:32:44,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:32:44,883 INFO L87 Difference]: Start difference. First operand 3041 states and 4175 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:46,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:46,378 INFO L93 Difference]: Finished difference Result 3789 states and 5172 transitions. [2024-11-11 21:32:46,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:32:46,379 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-11 21:32:46,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:46,392 INFO L225 Difference]: With dead ends: 3789 [2024-11-11 21:32:46,393 INFO L226 Difference]: Without dead ends: 3784 [2024-11-11 21:32:46,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:32:46,395 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 6187 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 2668 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6187 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:46,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6187 Valid, 2679 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2668 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 21:32:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2024-11-11 21:32:46,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3041. [2024-11-11 21:32:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3035 states have (on average 1.3752883031301482) internal successors, (4174), 3040 states have internal predecessors, (4174), 0 states have call successors, (0), 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-11 21:32:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4174 transitions. [2024-11-11 21:32:46,470 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4174 transitions. Word has length 53 [2024-11-11 21:32:46,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:46,472 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 4174 transitions. [2024-11-11 21:32:46,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4174 transitions. [2024-11-11 21:32:46,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 21:32:46,476 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:46,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:46,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:32:46,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:46,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1162103691, now seen corresponding path program 1 times [2024-11-11 21:32:46,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:46,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850534101] [2024-11-11 21:32:46,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:46,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:46,777 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-11 21:32:46,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:46,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850534101] [2024-11-11 21:32:46,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850534101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:46,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:46,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:32:46,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367042477] [2024-11-11 21:32:46,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:46,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:32:46,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:46,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:32:46,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:32:46,780 INFO L87 Difference]: Start difference. First operand 3041 states and 4174 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:47,951 INFO L93 Difference]: Finished difference Result 4353 states and 6077 transitions. [2024-11-11 21:32:47,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:32:47,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-11 21:32:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:47,963 INFO L225 Difference]: With dead ends: 4353 [2024-11-11 21:32:47,963 INFO L226 Difference]: Without dead ends: 3682 [2024-11-11 21:32:47,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-11 21:32:47,966 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 6319 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6319 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:47,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6319 Valid, 2183 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1941 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 21:32:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3682 states. [2024-11-11 21:32:48,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3682 to 3041. [2024-11-11 21:32:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3035 states have (on average 1.3749588138385502) internal successors, (4173), 3040 states have internal predecessors, (4173), 0 states have call successors, (0), 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-11 21:32:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4173 transitions. [2024-11-11 21:32:48,023 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4173 transitions. Word has length 53 [2024-11-11 21:32:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:48,023 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 4173 transitions. [2024-11-11 21:32:48,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4173 transitions. [2024-11-11 21:32:48,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 21:32:48,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:48,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:48,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:32:48,027 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:48,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:48,028 INFO L85 PathProgramCache]: Analyzing trace with hash -482264145, now seen corresponding path program 1 times [2024-11-11 21:32:48,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:48,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499898749] [2024-11-11 21:32:48,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:48,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:48,101 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-11 21:32:48,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:48,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499898749] [2024-11-11 21:32:48,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499898749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:48,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:48,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:32:48,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34786394] [2024-11-11 21:32:48,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:48,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:32:48,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:48,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:32:48,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:32:48,113 INFO L87 Difference]: Start difference. First operand 3041 states and 4173 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:48,193 INFO L93 Difference]: Finished difference Result 3997 states and 5638 transitions. [2024-11-11 21:32:48,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:32:48,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-11 21:32:48,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:48,203 INFO L225 Difference]: With dead ends: 3997 [2024-11-11 21:32:48,204 INFO L226 Difference]: Without dead ends: 3094 [2024-11-11 21:32:48,206 INFO L434 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-11 21:32:48,207 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 579 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:48,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1785 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:32:48,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2024-11-11 21:32:48,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3092. [2024-11-11 21:32:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3092 states, 3086 states have (on average 1.3833441348023332) internal successors, (4269), 3091 states have internal predecessors, (4269), 0 states have call successors, (0), 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-11 21:32:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4269 transitions. [2024-11-11 21:32:48,260 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4269 transitions. Word has length 54 [2024-11-11 21:32:48,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:48,261 INFO L471 AbstractCegarLoop]: Abstraction has 3092 states and 4269 transitions. [2024-11-11 21:32:48,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4269 transitions. [2024-11-11 21:32:48,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 21:32:48,263 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:48,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:48,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:32:48,263 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:48,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:48,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1622556323, now seen corresponding path program 1 times [2024-11-11 21:32:48,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:48,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019759206] [2024-11-11 21:32:48,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:48,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:48,348 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-11 21:32:48,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:48,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019759206] [2024-11-11 21:32:48,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019759206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:48,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:48,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:32:48,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633758397] [2024-11-11 21:32:48,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:48,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:32:48,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:48,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:32:48,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:32:48,351 INFO L87 Difference]: Start difference. First operand 3092 states and 4269 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:48,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:48,420 INFO L93 Difference]: Finished difference Result 4733 states and 6803 transitions. [2024-11-11 21:32:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:32:48,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-11 21:32:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:48,432 INFO L225 Difference]: With dead ends: 4733 [2024-11-11 21:32:48,433 INFO L226 Difference]: Without dead ends: 3514 [2024-11-11 21:32:48,435 INFO L434 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-11 21:32:48,436 INFO L435 NwaCegarLoop]: 1143 mSDtfsCounter, 577 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:48,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 1736 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:32:48,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2024-11-11 21:32:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 3512. [2024-11-11 21:32:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3512 states, 3506 states have (on average 1.4110096976611524) internal successors, (4947), 3511 states have internal predecessors, (4947), 0 states have call successors, (0), 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-11 21:32:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 4947 transitions. [2024-11-11 21:32:48,496 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 4947 transitions. Word has length 54 [2024-11-11 21:32:48,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:48,497 INFO L471 AbstractCegarLoop]: Abstraction has 3512 states and 4947 transitions. [2024-11-11 21:32:48,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 4947 transitions. [2024-11-11 21:32:48,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 21:32:48,500 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:48,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:48,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:32:48,501 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:48,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:48,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1612308197, now seen corresponding path program 1 times [2024-11-11 21:32:48,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:48,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618585568] [2024-11-11 21:32:48,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:48,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:48,560 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-11 21:32:48,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:48,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618585568] [2024-11-11 21:32:48,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618585568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:48,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:48,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:32:48,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37235611] [2024-11-11 21:32:48,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:48,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:32:48,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:48,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:32:48,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:32:48,563 INFO L87 Difference]: Start difference. First operand 3512 states and 4947 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:48,689 INFO L93 Difference]: Finished difference Result 7801 states and 11245 transitions. [2024-11-11 21:32:48,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:32:48,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-11 21:32:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:48,711 INFO L225 Difference]: With dead ends: 7801 [2024-11-11 21:32:48,711 INFO L226 Difference]: Without dead ends: 5349 [2024-11-11 21:32:48,716 INFO L434 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-11 21:32:48,717 INFO L435 NwaCegarLoop]: 1200 mSDtfsCounter, 649 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:48,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1961 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:32:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5349 states. [2024-11-11 21:32:48,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5349 to 5343. [2024-11-11 21:32:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5343 states, 5337 states have (on average 1.405283867341203) internal successors, (7500), 5342 states have internal predecessors, (7500), 0 states have call successors, (0), 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-11 21:32:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 7500 transitions. [2024-11-11 21:32:48,860 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 7500 transitions. Word has length 54 [2024-11-11 21:32:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:48,861 INFO L471 AbstractCegarLoop]: Abstraction has 5343 states and 7500 transitions. [2024-11-11 21:32:48,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:48,862 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 7500 transitions. [2024-11-11 21:32:48,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 21:32:48,866 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:48,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:48,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:32:48,866 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:48,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:48,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1623263409, now seen corresponding path program 1 times [2024-11-11 21:32:48,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:48,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658294064] [2024-11-11 21:32:48,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:48,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:48,937 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-11 21:32:48,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:48,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658294064] [2024-11-11 21:32:48,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658294064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:48,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:48,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:32:48,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420680043] [2024-11-11 21:32:48,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:48,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:32:48,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:48,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:32:48,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:32:48,940 INFO L87 Difference]: Start difference. First operand 5343 states and 7500 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:49,054 INFO L93 Difference]: Finished difference Result 9822 states and 14011 transitions. [2024-11-11 21:32:49,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:32:49,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-11 21:32:49,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:49,064 INFO L225 Difference]: With dead ends: 9822 [2024-11-11 21:32:49,064 INFO L226 Difference]: Without dead ends: 5548 [2024-11-11 21:32:49,070 INFO L434 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-11 21:32:49,070 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 848 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:49,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1285 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:32:49,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2024-11-11 21:32:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 4450. [2024-11-11 21:32:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4450 states, 4445 states have (on average 1.4213723284589426) internal successors, (6318), 4449 states have internal predecessors, (6318), 0 states have call successors, (0), 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-11 21:32:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4450 states to 4450 states and 6318 transitions. [2024-11-11 21:32:49,147 INFO L78 Accepts]: Start accepts. Automaton has 4450 states and 6318 transitions. Word has length 55 [2024-11-11 21:32:49,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:49,147 INFO L471 AbstractCegarLoop]: Abstraction has 4450 states and 6318 transitions. [2024-11-11 21:32:49,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 4450 states and 6318 transitions. [2024-11-11 21:32:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 21:32:49,150 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:49,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:49,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:32:49,151 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:49,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:49,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1493102210, now seen corresponding path program 1 times [2024-11-11 21:32:49,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:49,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917224171] [2024-11-11 21:32:49,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:49,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:49,208 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-11 21:32:49,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:49,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917224171] [2024-11-11 21:32:49,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917224171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:49,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:49,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:32:49,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813696556] [2024-11-11 21:32:49,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:49,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:32:49,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:49,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:32:49,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:32:49,211 INFO L87 Difference]: Start difference. First operand 4450 states and 6318 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:49,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:49,326 INFO L93 Difference]: Finished difference Result 8479 states and 12251 transitions. [2024-11-11 21:32:49,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:32:49,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-11 21:32:49,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:49,336 INFO L225 Difference]: With dead ends: 8479 [2024-11-11 21:32:49,336 INFO L226 Difference]: Without dead ends: 4773 [2024-11-11 21:32:49,340 INFO L434 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-11 21:32:49,341 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 659 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:49,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1016 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:32:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4773 states. [2024-11-11 21:32:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4773 to 3845. [2024-11-11 21:32:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3841 states have (on average 1.4308773756834159) internal successors, (5496), 3844 states have internal predecessors, (5496), 0 states have call successors, (0), 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-11 21:32:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 5496 transitions. [2024-11-11 21:32:49,398 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 5496 transitions. Word has length 55 [2024-11-11 21:32:49,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:49,398 INFO L471 AbstractCegarLoop]: Abstraction has 3845 states and 5496 transitions. [2024-11-11 21:32:49,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 5496 transitions. [2024-11-11 21:32:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 21:32:49,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:49,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:49,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:32:49,401 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:49,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:49,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1419432604, now seen corresponding path program 1 times [2024-11-11 21:32:49,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:49,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923243129] [2024-11-11 21:32:49,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:49,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:49,450 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-11 21:32:49,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:49,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923243129] [2024-11-11 21:32:49,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923243129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:49,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:49,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:32:49,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089466996] [2024-11-11 21:32:49,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:49,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:32:49,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:49,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:32:49,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:32:49,452 INFO L87 Difference]: Start difference. First operand 3845 states and 5496 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:49,565 INFO L93 Difference]: Finished difference Result 7664 states and 11130 transitions. [2024-11-11 21:32:49,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:32:49,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-11 21:32:49,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:49,573 INFO L225 Difference]: With dead ends: 7664 [2024-11-11 21:32:49,573 INFO L226 Difference]: Without dead ends: 4134 [2024-11-11 21:32:49,577 INFO L434 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-11 21:32:49,578 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 460 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:49,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 845 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:32:49,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4134 states. [2024-11-11 21:32:49,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4134 to 3399. [2024-11-11 21:32:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3399 states, 3395 states have (on average 1.4435935198821797) internal successors, (4901), 3398 states have internal predecessors, (4901), 0 states have call successors, (0), 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-11 21:32:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4901 transitions. [2024-11-11 21:32:49,627 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4901 transitions. Word has length 55 [2024-11-11 21:32:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:49,627 INFO L471 AbstractCegarLoop]: Abstraction has 3399 states and 4901 transitions. [2024-11-11 21:32:49,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4901 transitions. [2024-11-11 21:32:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 21:32:49,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:49,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:49,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:32:49,630 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:49,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:49,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1871407914, now seen corresponding path program 1 times [2024-11-11 21:32:49,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:49,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460689796] [2024-11-11 21:32:49,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:49,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:50,193 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-11 21:32:50,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:50,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460689796] [2024-11-11 21:32:50,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460689796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:50,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:50,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 21:32:50,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445194863] [2024-11-11 21:32:50,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:50,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:32:50,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:50,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:32:50,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:32:50,196 INFO L87 Difference]: Start difference. First operand 3399 states and 4901 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:51,096 INFO L93 Difference]: Finished difference Result 6894 states and 9992 transitions. [2024-11-11 21:32:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:32:51,097 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-11 21:32:51,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:51,109 INFO L225 Difference]: With dead ends: 6894 [2024-11-11 21:32:51,109 INFO L226 Difference]: Without dead ends: 6746 [2024-11-11 21:32:51,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:32:51,113 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 2957 mSDsluCounter, 3478 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2957 SdHoareTripleChecker+Valid, 4065 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:51,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2957 Valid, 4065 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:32:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6746 states. [2024-11-11 21:32:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6746 to 3347. [2024-11-11 21:32:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3347 states, 3344 states have (on average 1.444078947368421) internal successors, (4829), 3346 states have internal predecessors, (4829), 0 states have call successors, (0), 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-11 21:32:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3347 states to 3347 states and 4829 transitions. [2024-11-11 21:32:51,175 INFO L78 Accepts]: Start accepts. Automaton has 3347 states and 4829 transitions. Word has length 56 [2024-11-11 21:32:51,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:51,175 INFO L471 AbstractCegarLoop]: Abstraction has 3347 states and 4829 transitions. [2024-11-11 21:32:51,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3347 states and 4829 transitions. [2024-11-11 21:32:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 21:32:51,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:51,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:51,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:32:51,177 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:51,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1094868748, now seen corresponding path program 1 times [2024-11-11 21:32:51,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:51,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417022750] [2024-11-11 21:32:51,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:51,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:51,713 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-11 21:32:51,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:51,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417022750] [2024-11-11 21:32:51,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417022750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:51,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:51,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 21:32:51,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120499434] [2024-11-11 21:32:51,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:51,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 21:32:51,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:51,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 21:32:51,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:32:51,716 INFO L87 Difference]: Start difference. First operand 3347 states and 4829 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:52,364 INFO L93 Difference]: Finished difference Result 6797 states and 9890 transitions. [2024-11-11 21:32:52,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:32:52,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-11 21:32:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:52,374 INFO L225 Difference]: With dead ends: 6797 [2024-11-11 21:32:52,375 INFO L226 Difference]: Without dead ends: 6653 [2024-11-11 21:32:52,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:32:52,377 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 3890 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3890 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:52,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3890 Valid, 1977 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:32:52,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6653 states. [2024-11-11 21:32:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6653 to 3299. [2024-11-11 21:32:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3299 states, 3298 states have (on average 1.4460278956943602) internal successors, (4769), 3298 states have internal predecessors, (4769), 0 states have call successors, (0), 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-11 21:32:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 3299 states and 4769 transitions. [2024-11-11 21:32:52,427 INFO L78 Accepts]: Start accepts. Automaton has 3299 states and 4769 transitions. Word has length 56 [2024-11-11 21:32:52,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:52,428 INFO L471 AbstractCegarLoop]: Abstraction has 3299 states and 4769 transitions. [2024-11-11 21:32:52,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 4769 transitions. [2024-11-11 21:32:52,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 21:32:52,430 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:52,430 INFO L218 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] [2024-11-11 21:32:52,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:32:52,431 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:52,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:52,431 INFO L85 PathProgramCache]: Analyzing trace with hash -101338621, now seen corresponding path program 1 times [2024-11-11 21:32:52,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:52,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692077476] [2024-11-11 21:32:52,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:52,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:52,526 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-11 21:32:52,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:52,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692077476] [2024-11-11 21:32:52,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692077476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:52,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:52,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:32:52,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542057488] [2024-11-11 21:32:52,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:52,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:32:52,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:52,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:32:52,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:32:52,529 INFO L87 Difference]: Start difference. First operand 3299 states and 4769 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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-11 21:32:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:52,629 INFO L93 Difference]: Finished difference Result 10256 states and 15162 transitions. [2024-11-11 21:32:52,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:32:52,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-11 21:32:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:52,641 INFO L225 Difference]: With dead ends: 10256 [2024-11-11 21:32:52,642 INFO L226 Difference]: Without dead ends: 7534 [2024-11-11 21:32:52,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11 21:32:52,648 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 1628 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:52,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 952 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:32:52,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7534 states. [2024-11-11 21:32:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7534 to 5718. [2024-11-11 21:32:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5718 states, 5717 states have (on average 1.4455133811439567) internal successors, (8264), 5717 states have internal predecessors, (8264), 0 states have call successors, (0), 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-11 21:32:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5718 states to 5718 states and 8264 transitions. [2024-11-11 21:32:52,731 INFO L78 Accepts]: Start accepts. Automaton has 5718 states and 8264 transitions. Word has length 63 [2024-11-11 21:32:52,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:52,732 INFO L471 AbstractCegarLoop]: Abstraction has 5718 states and 8264 transitions. [2024-11-11 21:32:52,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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-11 21:32:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 5718 states and 8264 transitions. [2024-11-11 21:32:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-11 21:32:52,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:52,735 INFO L218 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] [2024-11-11 21:32:52,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:32:52,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:52,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash 838129574, now seen corresponding path program 1 times [2024-11-11 21:32:52,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:52,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127390709] [2024-11-11 21:32:52,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:52,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:52,894 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-11 21:32:52,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:52,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127390709] [2024-11-11 21:32:52,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127390709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:52,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:52,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:32:52,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072602527] [2024-11-11 21:32:52,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:52,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:32:52,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:52,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:32:52,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:32:52,897 INFO L87 Difference]: Start difference. First operand 5718 states and 8264 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 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-11 21:32:52,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:52,990 INFO L93 Difference]: Finished difference Result 9724 states and 14141 transitions. [2024-11-11 21:32:52,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:32:52,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-11-11 21:32:52,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:52,997 INFO L225 Difference]: With dead ends: 9724 [2024-11-11 21:32:52,997 INFO L226 Difference]: Without dead ends: 4562 [2024-11-11 21:32:53,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:32:53,003 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 910 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:53,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 821 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:32:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4562 states. [2024-11-11 21:32:53,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4562 to 4558. [2024-11-11 21:32:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4558 states, 4557 states have (on average 1.4318630678077682) internal successors, (6525), 4557 states have internal predecessors, (6525), 0 states have call successors, (0), 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-11 21:32:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4558 states to 4558 states and 6525 transitions. [2024-11-11 21:32:53,056 INFO L78 Accepts]: Start accepts. Automaton has 4558 states and 6525 transitions. Word has length 64 [2024-11-11 21:32:53,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:53,056 INFO L471 AbstractCegarLoop]: Abstraction has 4558 states and 6525 transitions. [2024-11-11 21:32:53,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 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-11 21:32:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 4558 states and 6525 transitions. [2024-11-11 21:32:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 21:32:53,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:53,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:53,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:32:53,060 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:53,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:53,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1809556404, now seen corresponding path program 1 times [2024-11-11 21:32:53,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:53,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237184622] [2024-11-11 21:32:53,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:53,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:53,165 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-11 21:32:53,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:53,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237184622] [2024-11-11 21:32:53,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237184622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:53,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:53,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:32:53,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263101879] [2024-11-11 21:32:53,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:53,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:32:53,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:53,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:32:53,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:32:53,168 INFO L87 Difference]: Start difference. First operand 4558 states and 6525 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:53,244 INFO L93 Difference]: Finished difference Result 12182 states and 17659 transitions. [2024-11-11 21:32:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:32:53,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-11 21:32:53,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:53,253 INFO L225 Difference]: With dead ends: 12182 [2024-11-11 21:32:53,254 INFO L226 Difference]: Without dead ends: 8158 [2024-11-11 21:32:53,260 INFO L434 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-11 21:32:53,260 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 298 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:53,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 782 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:32:53,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8158 states. [2024-11-11 21:32:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8158 to 7644. [2024-11-11 21:32:53,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7644 states, 7643 states have (on average 1.4353002747612194) internal successors, (10970), 7643 states have internal predecessors, (10970), 0 states have call successors, (0), 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-11 21:32:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7644 states to 7644 states and 10970 transitions. [2024-11-11 21:32:53,356 INFO L78 Accepts]: Start accepts. Automaton has 7644 states and 10970 transitions. Word has length 66 [2024-11-11 21:32:53,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:53,356 INFO L471 AbstractCegarLoop]: Abstraction has 7644 states and 10970 transitions. [2024-11-11 21:32:53,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 7644 states and 10970 transitions. [2024-11-11 21:32:53,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 21:32:53,359 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:53,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:53,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:32:53,359 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:53,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:53,360 INFO L85 PathProgramCache]: Analyzing trace with hash 827517135, now seen corresponding path program 1 times [2024-11-11 21:32:53,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:53,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298433186] [2024-11-11 21:32:53,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:53,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:53,458 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-11 21:32:53,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:53,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298433186] [2024-11-11 21:32:53,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298433186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:53,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:53,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:32:53,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301648384] [2024-11-11 21:32:53,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:53,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:32:53,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:53,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:32:53,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:32:53,460 INFO L87 Difference]: Start difference. First operand 7644 states and 10970 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:53,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:53,554 INFO L93 Difference]: Finished difference Result 21104 states and 30452 transitions. [2024-11-11 21:32:53,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:32:53,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-11 21:32:53,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:53,572 INFO L225 Difference]: With dead ends: 21104 [2024-11-11 21:32:53,573 INFO L226 Difference]: Without dead ends: 13994 [2024-11-11 21:32:53,583 INFO L434 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-11 21:32:53,585 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 258 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:53,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 803 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:32:53,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13994 states. [2024-11-11 21:32:53,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13994 to 12968. [2024-11-11 21:32:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12968 states, 12967 states have (on average 1.4299375337394926) internal successors, (18542), 12967 states have internal predecessors, (18542), 0 states have call successors, (0), 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-11 21:32:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12968 states to 12968 states and 18542 transitions. [2024-11-11 21:32:53,905 INFO L78 Accepts]: Start accepts. Automaton has 12968 states and 18542 transitions. Word has length 66 [2024-11-11 21:32:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:53,906 INFO L471 AbstractCegarLoop]: Abstraction has 12968 states and 18542 transitions. [2024-11-11 21:32:53,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 12968 states and 18542 transitions. [2024-11-11 21:32:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 21:32:53,909 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:53,909 INFO L218 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] [2024-11-11 21:32:53,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:32:53,910 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:53,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1051118849, now seen corresponding path program 1 times [2024-11-11 21:32:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488295929] [2024-11-11 21:32:53,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:54,187 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-11 21:32:54,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:54,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488295929] [2024-11-11 21:32:54,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488295929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:54,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:54,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:32:54,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107520541] [2024-11-11 21:32:54,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:54,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:32:54,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:54,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:32:54,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:32:54,190 INFO L87 Difference]: Start difference. First operand 12968 states and 18542 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 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-11 21:32:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:55,002 INFO L93 Difference]: Finished difference Result 28104 states and 39784 transitions. [2024-11-11 21:32:55,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:32:55,003 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-11-11 21:32:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:55,022 INFO L225 Difference]: With dead ends: 28104 [2024-11-11 21:32:55,022 INFO L226 Difference]: Without dead ends: 19249 [2024-11-11 21:32:55,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:32:55,033 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 2318 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2318 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:55,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2318 Valid, 1170 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:32:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19249 states. [2024-11-11 21:32:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19249 to 12948. [2024-11-11 21:32:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12948 states, 12947 states have (on average 1.4303699698771917) internal successors, (18519), 12947 states have internal predecessors, (18519), 0 states have call successors, (0), 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-11 21:32:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12948 states to 12948 states and 18519 transitions. [2024-11-11 21:32:55,326 INFO L78 Accepts]: Start accepts. Automaton has 12948 states and 18519 transitions. Word has length 68 [2024-11-11 21:32:55,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:55,327 INFO L471 AbstractCegarLoop]: Abstraction has 12948 states and 18519 transitions. [2024-11-11 21:32:55,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 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-11 21:32:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 12948 states and 18519 transitions. [2024-11-11 21:32:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 21:32:55,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:55,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:55,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:32:55,330 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:55,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:55,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1041744755, now seen corresponding path program 1 times [2024-11-11 21:32:55,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:55,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811091925] [2024-11-11 21:32:55,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:55,563 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-11 21:32:55,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:55,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811091925] [2024-11-11 21:32:55,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811091925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:55,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:55,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:32:55,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042332666] [2024-11-11 21:32:55,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:55,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:32:55,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:55,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:32:55,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:32:55,565 INFO L87 Difference]: Start difference. First operand 12948 states and 18519 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:55,623 INFO L93 Difference]: Finished difference Result 14054 states and 19992 transitions. [2024-11-11 21:32:55,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:32:55,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-11 21:32:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:55,641 INFO L225 Difference]: With dead ends: 14054 [2024-11-11 21:32:55,642 INFO L226 Difference]: Without dead ends: 14052 [2024-11-11 21:32:55,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:32:55,648 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 1922 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:55,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2405 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:32:55,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14052 states. [2024-11-11 21:32:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14052 to 14052. [2024-11-11 21:32:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14052 states, 14051 states have (on average 1.3965554053092306) internal successors, (19623), 14051 states have internal predecessors, (19623), 0 states have call successors, (0), 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-11 21:32:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14052 states to 14052 states and 19623 transitions. [2024-11-11 21:32:55,822 INFO L78 Accepts]: Start accepts. Automaton has 14052 states and 19623 transitions. Word has length 69 [2024-11-11 21:32:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:55,822 INFO L471 AbstractCegarLoop]: Abstraction has 14052 states and 19623 transitions. [2024-11-11 21:32:55,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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-11 21:32:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand 14052 states and 19623 transitions. [2024-11-11 21:32:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 21:32:55,825 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:55,825 INFO L218 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] [2024-11-11 21:32:55,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:32:55,825 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:55,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:55,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2108754892, now seen corresponding path program 1 times [2024-11-11 21:32:55,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:55,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050175716] [2024-11-11 21:32:55,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:55,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:55,890 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-11 21:32:55,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:55,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050175716] [2024-11-11 21:32:55,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050175716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:55,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:55,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:32:55,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174134761] [2024-11-11 21:32:55,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:55,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:32:55,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:55,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:32:55,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:32:55,892 INFO L87 Difference]: Start difference. First operand 14052 states and 19623 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-11 21:32:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:56,023 INFO L93 Difference]: Finished difference Result 38052 states and 53259 transitions. [2024-11-11 21:32:56,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:32:56,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-11-11 21:32:56,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:56,062 INFO L225 Difference]: With dead ends: 38052 [2024-11-11 21:32:56,062 INFO L226 Difference]: Without dead ends: 24502 [2024-11-11 21:32:56,086 INFO L434 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-11 21:32:56,087 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 298 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:56,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 698 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:32:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24502 states. [2024-11-11 21:32:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24502 to 24132. [2024-11-11 21:32:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24132 states, 24131 states have (on average 1.3717210227508185) internal successors, (33101), 24131 states have internal predecessors, (33101), 0 states have call successors, (0), 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-11 21:32:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24132 states to 24132 states and 33101 transitions. [2024-11-11 21:32:56,420 INFO L78 Accepts]: Start accepts. Automaton has 24132 states and 33101 transitions. Word has length 70 [2024-11-11 21:32:56,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:56,421 INFO L471 AbstractCegarLoop]: Abstraction has 24132 states and 33101 transitions. [2024-11-11 21:32:56,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-11 21:32:56,421 INFO L276 IsEmpty]: Start isEmpty. Operand 24132 states and 33101 transitions. [2024-11-11 21:32:56,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-11 21:32:56,423 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:56,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:32:56,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:32:56,423 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:56,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:56,424 INFO L85 PathProgramCache]: Analyzing trace with hash -761417871, now seen corresponding path program 1 times [2024-11-11 21:32:56,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:56,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369587311] [2024-11-11 21:32:56,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:56,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:56,542 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-11 21:32:56,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:56,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369587311] [2024-11-11 21:32:56,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369587311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:56,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:56,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:32:56,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716601728] [2024-11-11 21:32:56,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:56,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:32:56,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:56,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:32:56,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:32:56,545 INFO L87 Difference]: Start difference. First operand 24132 states and 33101 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:56,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:56,710 INFO L93 Difference]: Finished difference Result 41414 states and 56971 transitions. [2024-11-11 21:32:56,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:32:56,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-11 21:32:56,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:56,762 INFO L225 Difference]: With dead ends: 41414 [2024-11-11 21:32:56,763 INFO L226 Difference]: Without dead ends: 34332 [2024-11-11 21:32:56,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:32:56,785 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 1043 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:56,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 1192 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:32:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34332 states. [2024-11-11 21:32:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34332 to 29878. [2024-11-11 21:32:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29878 states, 29877 states have (on average 1.3669043076614118) internal successors, (40839), 29877 states have internal predecessors, (40839), 0 states have call successors, (0), 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-11 21:32:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29878 states to 29878 states and 40839 transitions. [2024-11-11 21:32:57,357 INFO L78 Accepts]: Start accepts. Automaton has 29878 states and 40839 transitions. Word has length 73 [2024-11-11 21:32:57,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:57,358 INFO L471 AbstractCegarLoop]: Abstraction has 29878 states and 40839 transitions. [2024-11-11 21:32:57,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:32:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 29878 states and 40839 transitions. [2024-11-11 21:32:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 21:32:57,360 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:57,360 INFO L218 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] [2024-11-11 21:32:57,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:32:57,361 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:57,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:57,361 INFO L85 PathProgramCache]: Analyzing trace with hash -669489783, now seen corresponding path program 1 times [2024-11-11 21:32:57,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:57,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685035215] [2024-11-11 21:32:57,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:57,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:57,688 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-11 21:32:57,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:57,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685035215] [2024-11-11 21:32:57,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685035215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:57,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:57,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:32:57,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781790668] [2024-11-11 21:32:57,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:57,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:32:57,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:57,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:32:57,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:32:57,691 INFO L87 Difference]: Start difference. First operand 29878 states and 40839 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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-11 21:32:57,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:57,931 INFO L93 Difference]: Finished difference Result 44982 states and 61699 transitions. [2024-11-11 21:32:57,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:32:57,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-11-11 21:32:57,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:57,987 INFO L225 Difference]: With dead ends: 44982 [2024-11-11 21:32:57,988 INFO L226 Difference]: Without dead ends: 37900 [2024-11-11 21:32:58,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:32:58,008 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 980 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:58,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 1249 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:32:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37900 states. [2024-11-11 21:32:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37900 to 35622. [2024-11-11 21:32:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35622 states, 35621 states have (on average 1.3636618848432105) internal successors, (48575), 35621 states have internal predecessors, (48575), 0 states have call successors, (0), 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-11 21:32:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35622 states to 35622 states and 48575 transitions. [2024-11-11 21:32:58,609 INFO L78 Accepts]: Start accepts. Automaton has 35622 states and 48575 transitions. Word has length 74 [2024-11-11 21:32:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:58,610 INFO L471 AbstractCegarLoop]: Abstraction has 35622 states and 48575 transitions. [2024-11-11 21:32:58,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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-11 21:32:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 35622 states and 48575 transitions. [2024-11-11 21:32:58,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 21:32:58,616 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:58,616 INFO L218 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] [2024-11-11 21:32:58,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 21:32:58,620 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:58,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:58,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1856624705, now seen corresponding path program 1 times [2024-11-11 21:32:58,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:58,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806531086] [2024-11-11 21:32:58,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:58,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:58,818 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-11 21:32:58,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:58,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806531086] [2024-11-11 21:32:58,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806531086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:58,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:58,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:32:58,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331386205] [2024-11-11 21:32:58,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:58,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:32:58,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:58,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:32:58,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:32:58,820 INFO L87 Difference]: Start difference. First operand 35622 states and 48575 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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-11 21:32:59,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:32:59,062 INFO L93 Difference]: Finished difference Result 52846 states and 72323 transitions. [2024-11-11 21:32:59,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:32:59,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-11-11 21:32:59,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:32:59,114 INFO L225 Difference]: With dead ends: 52846 [2024-11-11 21:32:59,114 INFO L226 Difference]: Without dead ends: 44140 [2024-11-11 21:32:59,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:32:59,132 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 987 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:32:59,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 1204 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:32:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44140 states. [2024-11-11 21:32:59,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44140 to 41862. [2024-11-11 21:32:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41862 states, 41861 states have (on average 1.3599054012087624) internal successors, (56927), 41861 states have internal predecessors, (56927), 0 states have call successors, (0), 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-11 21:32:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41862 states to 41862 states and 56927 transitions. [2024-11-11 21:32:59,710 INFO L78 Accepts]: Start accepts. Automaton has 41862 states and 56927 transitions. Word has length 74 [2024-11-11 21:32:59,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:32:59,710 INFO L471 AbstractCegarLoop]: Abstraction has 41862 states and 56927 transitions. [2024-11-11 21:32:59,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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-11 21:32:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 41862 states and 56927 transitions. [2024-11-11 21:32:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:32:59,715 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:32:59,715 INFO L218 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] [2024-11-11 21:32:59,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 21:32:59,715 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:32:59,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:32:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash 324913683, now seen corresponding path program 1 times [2024-11-11 21:32:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:32:59,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000545316] [2024-11-11 21:32:59,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:32:59,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:32:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:32:59,872 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-11 21:32:59,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:32:59,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000545316] [2024-11-11 21:32:59,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000545316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:32:59,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:32:59,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:32:59,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958537724] [2024-11-11 21:32:59,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:32:59,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:32:59,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:32:59,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:32:59,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:32:59,874 INFO L87 Difference]: Start difference. First operand 41862 states and 56927 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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-11 21:33:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:33:00,265 INFO L93 Difference]: Finished difference Result 56652 states and 77162 transitions. [2024-11-11 21:33:00,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:33:00,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:33:00,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:33:00,325 INFO L225 Difference]: With dead ends: 56652 [2024-11-11 21:33:00,325 INFO L226 Difference]: Without dead ends: 43826 [2024-11-11 21:33:00,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:33:00,345 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 996 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:33:00,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 1240 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:33:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43826 states. [2024-11-11 21:33:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43826 to 41550. [2024-11-11 21:33:00,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41550 states, 41549 states have (on average 1.3576018676743122) internal successors, (56407), 41549 states have internal predecessors, (56407), 0 states have call successors, (0), 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-11 21:33:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41550 states to 41550 states and 56407 transitions. [2024-11-11 21:33:01,009 INFO L78 Accepts]: Start accepts. Automaton has 41550 states and 56407 transitions. Word has length 81 [2024-11-11 21:33:01,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:33:01,010 INFO L471 AbstractCegarLoop]: Abstraction has 41550 states and 56407 transitions. [2024-11-11 21:33:01,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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-11 21:33:01,010 INFO L276 IsEmpty]: Start isEmpty. Operand 41550 states and 56407 transitions. [2024-11-11 21:33:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 21:33:01,014 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:33:01,014 INFO L218 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] [2024-11-11 21:33:01,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 21:33:01,015 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:33:01,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:33:01,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2144075086, now seen corresponding path program 1 times [2024-11-11 21:33:01,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:33:01,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042711779] [2024-11-11 21:33:01,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:01,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:33:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:01,382 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-11 21:33:01,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:33:01,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042711779] [2024-11-11 21:33:01,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042711779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:33:01,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:33:01,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:33:01,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99823818] [2024-11-11 21:33:01,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:33:01,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:33:01,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:33:01,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:33:01,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:33:01,384 INFO L87 Difference]: Start difference. First operand 41550 states and 56407 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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-11 21:33:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:33:01,976 INFO L93 Difference]: Finished difference Result 50911 states and 68998 transitions. [2024-11-11 21:33:01,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:33:01,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-11 21:33:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:33:02,046 INFO L225 Difference]: With dead ends: 50911 [2024-11-11 21:33:02,046 INFO L226 Difference]: Without dead ends: 49818 [2024-11-11 21:33:02,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:33:02,068 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 2017 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:33:02,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 585 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:33:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49818 states. [2024-11-11 21:33:02,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49818 to 41545. [2024-11-11 21:33:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41545 states, 41544 states have (on average 1.3575486231465435) internal successors, (56398), 41544 states have internal predecessors, (56398), 0 states have call successors, (0), 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-11 21:33:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41545 states to 41545 states and 56398 transitions. [2024-11-11 21:33:02,595 INFO L78 Accepts]: Start accepts. Automaton has 41545 states and 56398 transitions. Word has length 82 [2024-11-11 21:33:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:33:02,595 INFO L471 AbstractCegarLoop]: Abstraction has 41545 states and 56398 transitions. [2024-11-11 21:33:02,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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-11 21:33:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 41545 states and 56398 transitions. [2024-11-11 21:33:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-11 21:33:02,604 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:33:02,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:33:02,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 21:33:02,605 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:33:02,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:33:02,606 INFO L85 PathProgramCache]: Analyzing trace with hash 730861950, now seen corresponding path program 1 times [2024-11-11 21:33:02,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:33:02,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135343183] [2024-11-11 21:33:02,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:02,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:33:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:33:03,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:33:03,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135343183] [2024-11-11 21:33:03,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135343183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:33:03,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:33:03,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:33:03,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319201252] [2024-11-11 21:33:03,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:33:03,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:33:03,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:33:03,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:33:03,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:33:03,067 INFO L87 Difference]: Start difference. First operand 41545 states and 56398 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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-11 21:33:04,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:33:04,118 INFO L93 Difference]: Finished difference Result 96738 states and 130084 transitions. [2024-11-11 21:33:04,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:33:04,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-11 21:33:04,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:33:04,189 INFO L225 Difference]: With dead ends: 96738 [2024-11-11 21:33:04,189 INFO L226 Difference]: Without dead ends: 65536 [2024-11-11 21:33:04,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:33:04,213 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 2178 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2178 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:33:04,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2178 Valid, 1490 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:33:04,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65536 states. [2024-11-11 21:33:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65536 to 42019. [2024-11-11 21:33:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42019 states, 42018 states have (on average 1.3562520824408586) internal successors, (56987), 42018 states have internal predecessors, (56987), 0 states have call successors, (0), 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-11 21:33:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42019 states to 42019 states and 56987 transitions. [2024-11-11 21:33:04,839 INFO L78 Accepts]: Start accepts. Automaton has 42019 states and 56987 transitions. Word has length 89 [2024-11-11 21:33:04,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:33:04,839 INFO L471 AbstractCegarLoop]: Abstraction has 42019 states and 56987 transitions. [2024-11-11 21:33:04,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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-11 21:33:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 42019 states and 56987 transitions. [2024-11-11 21:33:04,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-11 21:33:04,849 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:33:04,849 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:33:04,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-11 21:33:04,849 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:33:04,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:33:04,850 INFO L85 PathProgramCache]: Analyzing trace with hash -167089379, now seen corresponding path program 1 times [2024-11-11 21:33:04,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:33:04,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484581882] [2024-11-11 21:33:04,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:04,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:33:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 21:33:05,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:33:05,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484581882] [2024-11-11 21:33:05,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484581882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:33:05,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:33:05,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:33:05,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840914077] [2024-11-11 21:33:05,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:33:05,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:33:05,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:33:05,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:33:05,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:33:05,237 INFO L87 Difference]: Start difference. First operand 42019 states and 56987 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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-11 21:33:05,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:33:05,977 INFO L93 Difference]: Finished difference Result 74368 states and 100419 transitions. [2024-11-11 21:33:05,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:33:05,978 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 89 [2024-11-11 21:33:05,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:33:06,048 INFO L225 Difference]: With dead ends: 74368 [2024-11-11 21:33:06,048 INFO L226 Difference]: Without dead ends: 58846 [2024-11-11 21:33:06,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:33:06,076 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 2475 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2475 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:33:06,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2475 Valid, 1058 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:33:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58846 states. [2024-11-11 21:33:06,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58846 to 42003. [2024-11-11 21:33:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42003 states, 42002 states have (on average 1.3563401742774153) internal successors, (56969), 42002 states have internal predecessors, (56969), 0 states have call successors, (0), 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-11 21:33:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42003 states to 42003 states and 56969 transitions. [2024-11-11 21:33:06,648 INFO L78 Accepts]: Start accepts. Automaton has 42003 states and 56969 transitions. Word has length 89 [2024-11-11 21:33:06,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:33:06,648 INFO L471 AbstractCegarLoop]: Abstraction has 42003 states and 56969 transitions. [2024-11-11 21:33:06,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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-11 21:33:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 42003 states and 56969 transitions. [2024-11-11 21:33:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-11 21:33:06,656 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:33:06,657 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:33:06,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 21:33:06,657 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:33:06,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:33:06,657 INFO L85 PathProgramCache]: Analyzing trace with hash 964121325, now seen corresponding path program 1 times [2024-11-11 21:33:06,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:33:06,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344621093] [2024-11-11 21:33:06,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:06,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:33:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:33:06,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:33:06,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344621093] [2024-11-11 21:33:06,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344621093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:33:06,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:33:06,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 21:33:06,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192622847] [2024-11-11 21:33:06,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:33:06,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:33:06,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:33:06,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:33:06,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:33:06,997 INFO L87 Difference]: Start difference. First operand 42003 states and 56969 transitions. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 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-11 21:33:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:33:08,088 INFO L93 Difference]: Finished difference Result 84599 states and 113615 transitions. [2024-11-11 21:33:08,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:33:08,088 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-11 21:33:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:33:08,160 INFO L225 Difference]: With dead ends: 84599 [2024-11-11 21:33:08,160 INFO L226 Difference]: Without dead ends: 69173 [2024-11-11 21:33:08,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2024-11-11 21:33:08,183 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 2064 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2064 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:33:08,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2064 Valid, 1529 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 21:33:08,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69173 states. [2024-11-11 21:33:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69173 to 60513. [2024-11-11 21:33:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60513 states, 60512 states have (on average 1.3490216816499208) internal successors, (81632), 60512 states have internal predecessors, (81632), 0 states have call successors, (0), 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-11 21:33:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60513 states to 60513 states and 81632 transitions. [2024-11-11 21:33:09,028 INFO L78 Accepts]: Start accepts. Automaton has 60513 states and 81632 transitions. Word has length 89 [2024-11-11 21:33:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:33:09,029 INFO L471 AbstractCegarLoop]: Abstraction has 60513 states and 81632 transitions. [2024-11-11 21:33:09,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 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-11 21:33:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 60513 states and 81632 transitions. [2024-11-11 21:33:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-11 21:33:09,041 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:33:09,041 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:33:09,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-11 21:33:09,041 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:33:09,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:33:09,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1490479423, now seen corresponding path program 1 times [2024-11-11 21:33:09,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:33:09,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386854020] [2024-11-11 21:33:09,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:09,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:33:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:33:09,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:33:09,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386854020] [2024-11-11 21:33:09,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386854020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:33:09,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:33:09,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:33:09,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089909992] [2024-11-11 21:33:09,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:33:09,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:33:09,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:33:09,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:33:09,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:33:09,159 INFO L87 Difference]: Start difference. First operand 60513 states and 81632 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-11 21:33:09,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:33:09,590 INFO L93 Difference]: Finished difference Result 119957 states and 162002 transitions. [2024-11-11 21:33:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:33:09,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-11 21:33:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:33:09,674 INFO L225 Difference]: With dead ends: 119957 [2024-11-11 21:33:09,674 INFO L226 Difference]: Without dead ends: 60515 [2024-11-11 21:33:09,722 INFO L434 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-11 21:33:09,723 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 173 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:33:09,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 820 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:33:09,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60515 states. [2024-11-11 21:33:10,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60515 to 60513. [2024-11-11 21:33:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60513 states, 60512 states have (on average 1.3338180856689583) internal successors, (80712), 60512 states have internal predecessors, (80712), 0 states have call successors, (0), 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-11 21:33:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60513 states to 60513 states and 80712 transitions. [2024-11-11 21:33:10,717 INFO L78 Accepts]: Start accepts. Automaton has 60513 states and 80712 transitions. Word has length 90 [2024-11-11 21:33:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:33:10,718 INFO L471 AbstractCegarLoop]: Abstraction has 60513 states and 80712 transitions. [2024-11-11 21:33:10,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-11 21:33:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 60513 states and 80712 transitions. [2024-11-11 21:33:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-11 21:33:10,729 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:33:10,729 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:33:10,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-11 21:33:10,729 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:33:10,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:33:10,730 INFO L85 PathProgramCache]: Analyzing trace with hash -324068378, now seen corresponding path program 1 times [2024-11-11 21:33:10,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:33:10,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773918798] [2024-11-11 21:33:10,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:10,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:33:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:33:10,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:33:10,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773918798] [2024-11-11 21:33:10,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773918798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:33:10,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365228282] [2024-11-11 21:33:10,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:10,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:33:10,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:33:10,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:33:10,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:33:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:11,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-11 21:33:11,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:33:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 21:33:12,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:33:12,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365228282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:33:12,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:33:12,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2024-11-11 21:33:12,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773328740] [2024-11-11 21:33:12,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:33:12,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:33:12,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:33:12,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:33:12,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-11 21:33:12,574 INFO L87 Difference]: Start difference. First operand 60513 states and 80712 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:33:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:33:14,228 INFO L93 Difference]: Finished difference Result 202187 states and 268443 transitions. [2024-11-11 21:33:14,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 21:33:14,228 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-11 21:33:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:33:14,406 INFO L225 Difference]: With dead ends: 202187 [2024-11-11 21:33:14,406 INFO L226 Difference]: Without dead ends: 159566 [2024-11-11 21:33:14,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2024-11-11 21:33:14,469 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 2592 mSDsluCounter, 3101 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2592 SdHoareTripleChecker+Valid, 3584 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:33:14,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2592 Valid, 3584 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 21:33:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159566 states. [2024-11-11 21:33:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159566 to 60473. [2024-11-11 21:33:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60473 states, 60472 states have (on average 1.3339231379812144) internal successors, (80665), 60472 states have internal predecessors, (80665), 0 states have call successors, (0), 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-11 21:33:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60473 states to 60473 states and 80665 transitions. [2024-11-11 21:33:15,980 INFO L78 Accepts]: Start accepts. Automaton has 60473 states and 80665 transitions. Word has length 90 [2024-11-11 21:33:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:33:15,981 INFO L471 AbstractCegarLoop]: Abstraction has 60473 states and 80665 transitions. [2024-11-11 21:33:15,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:33:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 60473 states and 80665 transitions. [2024-11-11 21:33:15,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-11 21:33:15,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:33:15,989 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:33:16,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 21:33:16,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:33:16,190 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:33:16,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:33:16,191 INFO L85 PathProgramCache]: Analyzing trace with hash 932069791, now seen corresponding path program 1 times [2024-11-11 21:33:16,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:33:16,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93800575] [2024-11-11 21:33:16,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:16,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:33:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:33:16,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:33:16,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93800575] [2024-11-11 21:33:16,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93800575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:33:16,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464981872] [2024-11-11 21:33:16,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:16,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:33:16,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:33:16,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:33:16,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:33:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:16,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-11 21:33:16,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:33:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:33:18,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:33:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:33:19,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464981872] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:33:19,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:33:19,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 28 [2024-11-11 21:33:19,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148144980] [2024-11-11 21:33:19,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:33:19,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-11 21:33:19,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:33:19,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-11 21:33:19,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2024-11-11 21:33:19,255 INFO L87 Difference]: Start difference. First operand 60473 states and 80665 transitions. Second operand has 29 states, 29 states have (on average 8.0) internal successors, (232), 28 states have internal predecessors, (232), 0 states have call successors, (0), 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-11 21:33:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:33:29,948 INFO L93 Difference]: Finished difference Result 449891 states and 594663 transitions. [2024-11-11 21:33:29,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2024-11-11 21:33:29,949 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.0) internal successors, (232), 28 states have internal predecessors, (232), 0 states have call successors, (0), 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 90 [2024-11-11 21:33:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:33:30,565 INFO L225 Difference]: With dead ends: 449891 [2024-11-11 21:33:30,565 INFO L226 Difference]: Without dead ends: 428753 [2024-11-11 21:33:30,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9367 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4750, Invalid=22972, Unknown=0, NotChecked=0, Total=27722 [2024-11-11 21:33:30,663 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 7201 mSDsluCounter, 6756 mSDsCounter, 0 mSdLazyCounter, 8468 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7201 SdHoareTripleChecker+Valid, 7247 SdHoareTripleChecker+Invalid, 8660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 8468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:33:30,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7201 Valid, 7247 Invalid, 8660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 8468 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-11 21:33:31,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428753 states. [2024-11-11 21:33:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428753 to 60862. [2024-11-11 21:33:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60862 states, 60861 states have (on average 1.3339577069059003) internal successors, (81186), 60861 states have internal predecessors, (81186), 0 states have call successors, (0), 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-11 21:33:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60862 states to 60862 states and 81186 transitions. [2024-11-11 21:33:34,391 INFO L78 Accepts]: Start accepts. Automaton has 60862 states and 81186 transitions. Word has length 90 [2024-11-11 21:33:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:33:34,391 INFO L471 AbstractCegarLoop]: Abstraction has 60862 states and 81186 transitions. [2024-11-11 21:33:34,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.0) internal successors, (232), 28 states have internal predecessors, (232), 0 states have call successors, (0), 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-11 21:33:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 60862 states and 81186 transitions. [2024-11-11 21:33:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-11 21:33:34,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:33:34,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:33:34,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 21:33:34,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-11 21:33:34,599 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:33:34,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:33:34,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1482359119, now seen corresponding path program 1 times [2024-11-11 21:33:34,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:33:34,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957572591] [2024-11-11 21:33:34,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:34,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:33:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 21:33:34,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:33:34,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957572591] [2024-11-11 21:33:34,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957572591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:33:34,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:33:34,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:33:34,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029857932] [2024-11-11 21:33:34,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:33:34,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:33:34,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:33:34,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:33:34,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:33:34,829 INFO L87 Difference]: Start difference. First operand 60862 states and 81186 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:33:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:33:35,573 INFO L93 Difference]: Finished difference Result 154093 states and 205201 transitions. [2024-11-11 21:33:35,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:33:35,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-11 21:33:35,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:33:35,722 INFO L225 Difference]: With dead ends: 154093 [2024-11-11 21:33:35,722 INFO L226 Difference]: Without dead ends: 120257 [2024-11-11 21:33:35,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-11 21:33:35,773 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 1558 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:33:35,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 1285 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:33:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120257 states. [2024-11-11 21:33:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120257 to 60850. [2024-11-11 21:33:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60850 states, 60849 states have (on average 1.3340071324097356) internal successors, (81173), 60849 states have internal predecessors, (81173), 0 states have call successors, (0), 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-11 21:33:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60850 states to 60850 states and 81173 transitions. [2024-11-11 21:33:36,972 INFO L78 Accepts]: Start accepts. Automaton has 60850 states and 81173 transitions. Word has length 90 [2024-11-11 21:33:36,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:33:36,972 INFO L471 AbstractCegarLoop]: Abstraction has 60850 states and 81173 transitions. [2024-11-11 21:33:36,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:33:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 60850 states and 81173 transitions. [2024-11-11 21:33:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-11 21:33:36,979 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:33:36,979 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:33:36,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-11 21:33:36,979 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:33:36,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:33:36,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1141325200, now seen corresponding path program 1 times [2024-11-11 21:33:36,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:33:36,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978693420] [2024-11-11 21:33:36,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:36,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:33:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:33:37,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:33:37,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978693420] [2024-11-11 21:33:37,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978693420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:33:37,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:33:37,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:33:37,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744023479] [2024-11-11 21:33:37,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:33:37,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:33:37,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:33:37,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:33:37,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:33:37,065 INFO L87 Difference]: Start difference. First operand 60850 states and 81173 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-11 21:33:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:33:37,278 INFO L93 Difference]: Finished difference Result 90574 states and 120919 transitions. [2024-11-11 21:33:37,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:33:37,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-11-11 21:33:37,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:33:37,816 INFO L225 Difference]: With dead ends: 90574 [2024-11-11 21:33:37,817 INFO L226 Difference]: Without dead ends: 31132 [2024-11-11 21:33:37,852 INFO L434 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-11 21:33:37,854 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 173 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:33:37,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 782 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:33:37,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31132 states. [2024-11-11 21:33:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31132 to 31130. [2024-11-11 21:33:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31130 states, 31129 states have (on average 1.3153972180282052) internal successors, (40947), 31129 states have internal predecessors, (40947), 0 states have call successors, (0), 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-11 21:33:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31130 states to 31130 states and 40947 transitions. [2024-11-11 21:33:38,128 INFO L78 Accepts]: Start accepts. Automaton has 31130 states and 40947 transitions. Word has length 91 [2024-11-11 21:33:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:33:38,128 INFO L471 AbstractCegarLoop]: Abstraction has 31130 states and 40947 transitions. [2024-11-11 21:33:38,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-11 21:33:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 31130 states and 40947 transitions. [2024-11-11 21:33:38,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-11 21:33:38,134 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:33:38,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:33:38,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-11 21:33:38,134 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:33:38,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:33:38,135 INFO L85 PathProgramCache]: Analyzing trace with hash 59884055, now seen corresponding path program 1 times [2024-11-11 21:33:38,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:33:38,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074124213] [2024-11-11 21:33:38,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:38,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:33:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:33:38,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:33:38,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074124213] [2024-11-11 21:33:38,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074124213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:33:38,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539542339] [2024-11-11 21:33:38,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:38,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:33:38,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:33:38,286 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:33:38,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 21:33:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:38,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 21:33:38,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:33:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:33:38,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:33:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:33:38,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539542339] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:33:38,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:33:38,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-11 21:33:38,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532387255] [2024-11-11 21:33:38,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:33:38,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:33:38,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:33:38,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:33:38,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:33:38,834 INFO L87 Difference]: Start difference. First operand 31130 states and 40947 transitions. Second operand has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 0 states have call successors, (0), 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-11 21:33:39,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:33:39,050 INFO L93 Difference]: Finished difference Result 92186 states and 120247 transitions. [2024-11-11 21:33:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:33:39,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-11-11 21:33:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:33:39,119 INFO L225 Difference]: With dead ends: 92186 [2024-11-11 21:33:39,119 INFO L226 Difference]: Without dead ends: 62464 [2024-11-11 21:33:39,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:33:39,150 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 547 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:33:39,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 2258 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:33:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62464 states.