./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ed6e4196d49d75b29a7ddd297e9986c08c6bd65f18221f72f78571f381f483e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:19:05,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:19:05,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:19:05,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:19:05,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:19:05,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:19:05,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:19:05,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:19:05,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:19:05,427 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:19:05,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:19:05,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:19:05,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:19:05,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:19:05,428 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:19:05,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:19:05,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:19:05,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:19:05,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:19:05,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:19:05,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:19:05,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:19:05,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:19:05,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:19:05,432 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:19:05,432 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:19:05,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:19:05,432 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:19:05,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:19:05,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:19:05,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:19:05,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:19:05,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:19:05,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:19:05,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:19:05,434 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:19:05,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:19:05,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:19:05,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:19:05,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:19:05,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:19:05,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:19:05,436 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 -> 0ed6e4196d49d75b29a7ddd297e9986c08c6bd65f18221f72f78571f381f483e [2024-10-12 20:19:05,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:19:05,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:19:05,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:19:05,676 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:19:05,676 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:19:05,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-12 20:19:06,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:19:07,177 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:19:07,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-12 20:19:07,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2d881acd/4fcd3e08b5dc4070bde6bf7f6c3a15bf/FLAGa125141ea [2024-10-12 20:19:07,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2d881acd/4fcd3e08b5dc4070bde6bf7f6c3a15bf [2024-10-12 20:19:07,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:19:07,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:19:07,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:19:07,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:19:07,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:19:07,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:19:07" (1/1) ... [2024-10-12 20:19:07,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c772bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:07, skipping insertion in model container [2024-10-12 20:19:07,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:19:07" (1/1) ... [2024-10-12 20:19:07,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:19:07,510 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8637,8650] [2024-10-12 20:19:07,548 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15862,15875] [2024-10-12 20:19:07,557 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18059,18072] [2024-10-12 20:19:07,561 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19083,19096] [2024-10-12 20:19:07,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:19:07,687 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:19:07,725 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8637,8650] [2024-10-12 20:19:07,747 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15862,15875] [2024-10-12 20:19:07,758 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18059,18072] [2024-10-12 20:19:07,764 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19083,19096] [2024-10-12 20:19:07,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:19:07,841 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:19:07,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:07 WrapperNode [2024-10-12 20:19:07,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:19:07,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:19:07,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:19:07,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:19:07,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:07" (1/1) ... [2024-10-12 20:19:07,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:07" (1/1) ... [2024-10-12 20:19:07,939 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2847 [2024-10-12 20:19:07,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:19:07,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:19:07,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:19:07,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:19:07,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:07" (1/1) ... [2024-10-12 20:19:07,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:07" (1/1) ... [2024-10-12 20:19:07,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:07" (1/1) ... [2024-10-12 20:19:07,995 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:19:07,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:07" (1/1) ... [2024-10-12 20:19:07,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:07" (1/1) ... [2024-10-12 20:19:08,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:07" (1/1) ... [2024-10-12 20:19:08,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:07" (1/1) ... [2024-10-12 20:19:08,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:07" (1/1) ... [2024-10-12 20:19:08,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:07" (1/1) ... [2024-10-12 20:19:08,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:19:08,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:19:08,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:19:08,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:19:08,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:07" (1/1) ... [2024-10-12 20:19:08,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:19:08,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:08,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:19:08,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:19:08,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:19:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:19:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:19:08,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:19:08,286 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:19:08,288 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:19:09,397 INFO L? ?]: Removed 486 outVars from TransFormulas that were not future-live. [2024-10-12 20:19:09,397 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:19:09,450 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:19:09,450 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:19:09,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:19:09 BoogieIcfgContainer [2024-10-12 20:19:09,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:19:09,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:19:09,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:19:09,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:19:09,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:19:07" (1/3) ... [2024-10-12 20:19:09,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5fa097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:19:09, skipping insertion in model container [2024-10-12 20:19:09,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:07" (2/3) ... [2024-10-12 20:19:09,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5fa097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:19:09, skipping insertion in model container [2024-10-12 20:19:09,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:19:09" (3/3) ... [2024-10-12 20:19:09,460 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-12 20:19:09,473 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:19:09,473 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-12 20:19:09,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:19:09,542 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;@320f5881, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:19:09,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-12 20:19:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 455 states, 450 states have (on average 1.8533333333333333) internal successors, (834), 454 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 20:19:09,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:09,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:09,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:09,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:09,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1875598250, now seen corresponding path program 1 times [2024-10-12 20:19:09,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:09,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496442135] [2024-10-12 20:19:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:09,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:09,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:09,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496442135] [2024-10-12 20:19:09,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496442135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:09,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:09,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:09,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761772772] [2024-10-12 20:19:09,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:09,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:09,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:09,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:09,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:09,996 INFO L87 Difference]: Start difference. First operand has 455 states, 450 states have (on average 1.8533333333333333) internal successors, (834), 454 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:10,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:10,097 INFO L93 Difference]: Finished difference Result 721 states and 1267 transitions. [2024-10-12 20:19:10,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:10,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-12 20:19:10,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:10,115 INFO L225 Difference]: With dead ends: 721 [2024-10-12 20:19:10,116 INFO L226 Difference]: Without dead ends: 570 [2024-10-12 20:19:10,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:10,124 INFO L432 NwaCegarLoop]: 859 mSDtfsCounter, 437 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:10,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1408 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:10,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-12 20:19:10,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 564. [2024-10-12 20:19:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 560 states have (on average 1.3446428571428573) internal successors, (753), 563 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 753 transitions. [2024-10-12 20:19:10,171 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 753 transitions. Word has length 50 [2024-10-12 20:19:10,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:10,171 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 753 transitions. [2024-10-12 20:19:10,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:10,171 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 753 transitions. [2024-10-12 20:19:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 20:19:10,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:10,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:10,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:19:10,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:10,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:10,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2061015356, now seen corresponding path program 1 times [2024-10-12 20:19:10,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:10,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389324853] [2024-10-12 20:19:10,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:10,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:10,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:10,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389324853] [2024-10-12 20:19:10,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389324853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:10,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:10,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:10,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532287229] [2024-10-12 20:19:10,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:10,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:10,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:10,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:10,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:10,286 INFO L87 Difference]: Start difference. First operand 564 states and 753 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:10,344 INFO L93 Difference]: Finished difference Result 993 states and 1378 transitions. [2024-10-12 20:19:10,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:10,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-12 20:19:10,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:10,347 INFO L225 Difference]: With dead ends: 993 [2024-10-12 20:19:10,347 INFO L226 Difference]: Without dead ends: 780 [2024-10-12 20:19:10,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:10,350 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 314 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:10,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1015 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-10-12 20:19:10,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 773. [2024-10-12 20:19:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 769 states have (on average 1.3719115734720415) internal successors, (1055), 772 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1055 transitions. [2024-10-12 20:19:10,380 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1055 transitions. Word has length 50 [2024-10-12 20:19:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:10,380 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1055 transitions. [2024-10-12 20:19:10,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1055 transitions. [2024-10-12 20:19:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 20:19:10,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:10,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:10,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:19:10,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:10,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:10,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2089668058, now seen corresponding path program 1 times [2024-10-12 20:19:10,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:10,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238141876] [2024-10-12 20:19:10,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:10,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:10,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:10,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238141876] [2024-10-12 20:19:10,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238141876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:10,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:10,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:10,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733202055] [2024-10-12 20:19:10,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:10,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:10,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:10,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:10,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:10,517 INFO L87 Difference]: Start difference. First operand 773 states and 1055 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:10,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:10,817 INFO L93 Difference]: Finished difference Result 1719 states and 2418 transitions. [2024-10-12 20:19:10,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:10,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-12 20:19:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:10,821 INFO L225 Difference]: With dead ends: 1719 [2024-10-12 20:19:10,821 INFO L226 Difference]: Without dead ends: 1062 [2024-10-12 20:19:10,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:10,823 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 1742 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:10,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 390 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:10,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2024-10-12 20:19:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1056. [2024-10-12 20:19:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1052 states have (on average 1.4077946768060836) internal successors, (1481), 1055 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1481 transitions. [2024-10-12 20:19:10,848 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1481 transitions. Word has length 50 [2024-10-12 20:19:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:10,849 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1481 transitions. [2024-10-12 20:19:10,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1481 transitions. [2024-10-12 20:19:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 20:19:10,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:10,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:10,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:19:10,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:10,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash -941949597, now seen corresponding path program 1 times [2024-10-12 20:19:10,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:10,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306747035] [2024-10-12 20:19:10,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:10,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:10,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:10,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306747035] [2024-10-12 20:19:10,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306747035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:10,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:10,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:10,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106856527] [2024-10-12 20:19:10,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:10,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:10,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:10,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:10,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:10,928 INFO L87 Difference]: Start difference. First operand 1056 states and 1481 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:10,970 INFO L93 Difference]: Finished difference Result 2560 states and 3636 transitions. [2024-10-12 20:19:10,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:10,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-12 20:19:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:10,976 INFO L225 Difference]: With dead ends: 2560 [2024-10-12 20:19:10,976 INFO L226 Difference]: Without dead ends: 1729 [2024-10-12 20:19:10,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:10,982 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 364 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:10,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 931 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:10,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2024-10-12 20:19:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1715. [2024-10-12 20:19:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1711 states have (on average 1.3921683226183519) internal successors, (2382), 1714 states have internal predecessors, (2382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2382 transitions. [2024-10-12 20:19:11,014 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2382 transitions. Word has length 51 [2024-10-12 20:19:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:11,015 INFO L471 AbstractCegarLoop]: Abstraction has 1715 states and 2382 transitions. [2024-10-12 20:19:11,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2382 transitions. [2024-10-12 20:19:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 20:19:11,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:11,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:11,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:19:11,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:11,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:11,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1880466014, now seen corresponding path program 1 times [2024-10-12 20:19:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:11,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301931187] [2024-10-12 20:19:11,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:11,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:11,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:11,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301931187] [2024-10-12 20:19:11,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301931187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:11,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:11,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:11,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58892109] [2024-10-12 20:19:11,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:11,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:11,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:11,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:11,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:11,114 INFO L87 Difference]: Start difference. First operand 1715 states and 2382 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:11,348 INFO L93 Difference]: Finished difference Result 3784 states and 5311 transitions. [2024-10-12 20:19:11,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:11,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-12 20:19:11,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:11,354 INFO L225 Difference]: With dead ends: 3784 [2024-10-12 20:19:11,354 INFO L226 Difference]: Without dead ends: 2240 [2024-10-12 20:19:11,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:11,356 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 1537 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:11,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 365 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:19:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2024-10-12 20:19:11,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2226. [2024-10-12 20:19:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2226 states, 2222 states have (on average 1.396939693969397) internal successors, (3104), 2225 states have internal predecessors, (3104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 3104 transitions. [2024-10-12 20:19:11,386 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 3104 transitions. Word has length 51 [2024-10-12 20:19:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:11,386 INFO L471 AbstractCegarLoop]: Abstraction has 2226 states and 3104 transitions. [2024-10-12 20:19:11,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 3104 transitions. [2024-10-12 20:19:11,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:19:11,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:11,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:11,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:19:11,388 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:11,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:11,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1402460387, now seen corresponding path program 1 times [2024-10-12 20:19:11,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:11,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931228781] [2024-10-12 20:19:11,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:11,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:11,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:11,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931228781] [2024-10-12 20:19:11,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931228781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:11,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:11,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:11,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067755363] [2024-10-12 20:19:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:11,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:11,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:11,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:11,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:11,495 INFO L87 Difference]: Start difference. First operand 2226 states and 3104 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-10-12 20:19:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:11,717 INFO L93 Difference]: Finished difference Result 5039 states and 7065 transitions. [2024-10-12 20:19:11,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:11,718 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-10-12 20:19:11,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:11,725 INFO L225 Difference]: With dead ends: 5039 [2024-10-12 20:19:11,725 INFO L226 Difference]: Without dead ends: 2984 [2024-10-12 20:19:11,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:11,728 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 1386 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:11,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 333 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:19:11,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2024-10-12 20:19:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2965. [2024-10-12 20:19:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2961 states have (on average 1.3904086457277947) internal successors, (4117), 2964 states have internal predecessors, (4117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4117 transitions. [2024-10-12 20:19:11,772 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4117 transitions. Word has length 52 [2024-10-12 20:19:11,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:11,773 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 4117 transitions. [2024-10-12 20:19:11,773 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-10-12 20:19:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4117 transitions. [2024-10-12 20:19:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:19:11,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:11,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:11,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:19:11,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:11,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash -78307905, now seen corresponding path program 1 times [2024-10-12 20:19:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:11,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220839124] [2024-10-12 20:19:11,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:11,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:11,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:11,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220839124] [2024-10-12 20:19:11,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220839124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:11,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:11,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:19:11,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591133671] [2024-10-12 20:19:11,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:11,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:19:11,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:11,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:19:11,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:11,948 INFO L87 Difference]: Start difference. First operand 2965 states and 4117 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:12,278 INFO L93 Difference]: Finished difference Result 5866 states and 8227 transitions. [2024-10-12 20:19:12,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:19:12,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-12 20:19:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:12,289 INFO L225 Difference]: With dead ends: 5866 [2024-10-12 20:19:12,289 INFO L226 Difference]: Without dead ends: 4545 [2024-10-12 20:19:12,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:19:12,293 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 1715 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:12,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 581 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:12,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2024-10-12 20:19:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 2979. [2024-10-12 20:19:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2979 states, 2975 states have (on average 1.3899159663865546) internal successors, (4135), 2978 states have internal predecessors, (4135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2979 states and 4135 transitions. [2024-10-12 20:19:12,361 INFO L78 Accepts]: Start accepts. Automaton has 2979 states and 4135 transitions. Word has length 53 [2024-10-12 20:19:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:12,361 INFO L471 AbstractCegarLoop]: Abstraction has 2979 states and 4135 transitions. [2024-10-12 20:19:12,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 4135 transitions. [2024-10-12 20:19:12,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:19:12,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:12,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:12,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:19:12,364 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:12,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1272319552, now seen corresponding path program 1 times [2024-10-12 20:19:12,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:12,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067703711] [2024-10-12 20:19:12,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:12,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:12,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:12,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067703711] [2024-10-12 20:19:12,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067703711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:12,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:12,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:19:12,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713318097] [2024-10-12 20:19:12,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:12,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:19:12,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:12,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:19:12,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:12,509 INFO L87 Difference]: Start difference. First operand 2979 states and 4135 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:12,848 INFO L93 Difference]: Finished difference Result 6537 states and 9200 transitions. [2024-10-12 20:19:12,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:19:12,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-12 20:19:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:12,864 INFO L225 Difference]: With dead ends: 6537 [2024-10-12 20:19:12,864 INFO L226 Difference]: Without dead ends: 5419 [2024-10-12 20:19:12,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:19:12,870 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 1840 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:12,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1840 Valid, 616 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:12,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5419 states. [2024-10-12 20:19:12,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5419 to 3001. [2024-10-12 20:19:12,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3001 states, 2997 states have (on average 1.3900567233900567) internal successors, (4166), 3000 states have internal predecessors, (4166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 3001 states and 4166 transitions. [2024-10-12 20:19:12,943 INFO L78 Accepts]: Start accepts. Automaton has 3001 states and 4166 transitions. Word has length 53 [2024-10-12 20:19:12,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:12,945 INFO L471 AbstractCegarLoop]: Abstraction has 3001 states and 4166 transitions. [2024-10-12 20:19:12,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:12,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 4166 transitions. [2024-10-12 20:19:12,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:19:12,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:12,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:12,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:19:12,947 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:12,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:12,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1821294495, now seen corresponding path program 1 times [2024-10-12 20:19:12,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:12,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603610644] [2024-10-12 20:19:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:12,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:13,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:13,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603610644] [2024-10-12 20:19:13,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603610644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:13,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:13,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:19:13,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248530907] [2024-10-12 20:19:13,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:13,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:19:13,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:13,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:19:13,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:13,055 INFO L87 Difference]: Start difference. First operand 3001 states and 4166 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:13,423 INFO L93 Difference]: Finished difference Result 7319 states and 10265 transitions. [2024-10-12 20:19:13,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:19:13,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-12 20:19:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:13,436 INFO L225 Difference]: With dead ends: 7319 [2024-10-12 20:19:13,437 INFO L226 Difference]: Without dead ends: 6351 [2024-10-12 20:19:13,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:19:13,439 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 1962 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:13,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 630 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6351 states. [2024-10-12 20:19:13,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6351 to 3035. [2024-10-12 20:19:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 3031 states have (on average 1.3889805344770703) internal successors, (4210), 3034 states have internal predecessors, (4210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4210 transitions. [2024-10-12 20:19:13,486 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4210 transitions. Word has length 53 [2024-10-12 20:19:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:13,486 INFO L471 AbstractCegarLoop]: Abstraction has 3035 states and 4210 transitions. [2024-10-12 20:19:13,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4210 transitions. [2024-10-12 20:19:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:19:13,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:13,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:13,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:19:13,488 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:13,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1007743463, now seen corresponding path program 1 times [2024-10-12 20:19:13,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:13,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400975652] [2024-10-12 20:19:13,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:13,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:13,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:13,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400975652] [2024-10-12 20:19:13,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400975652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:13,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:13,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:19:13,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143367655] [2024-10-12 20:19:13,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:13,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:19:13,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:13,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:19:13,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:13,720 INFO L87 Difference]: Start difference. First operand 3035 states and 4210 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:14,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:14,108 INFO L93 Difference]: Finished difference Result 6219 states and 8781 transitions. [2024-10-12 20:19:14,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:19:14,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-12 20:19:14,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:14,114 INFO L225 Difference]: With dead ends: 6219 [2024-10-12 20:19:14,114 INFO L226 Difference]: Without dead ends: 4258 [2024-10-12 20:19:14,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:19:14,117 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 1440 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:14,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 763 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4258 states. [2024-10-12 20:19:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4258 to 2948. [2024-10-12 20:19:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2948 states, 2944 states have (on average 1.388586956521739) internal successors, (4088), 2947 states have internal predecessors, (4088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 4088 transitions. [2024-10-12 20:19:14,149 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 4088 transitions. Word has length 54 [2024-10-12 20:19:14,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:14,149 INFO L471 AbstractCegarLoop]: Abstraction has 2948 states and 4088 transitions. [2024-10-12 20:19:14,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 4088 transitions. [2024-10-12 20:19:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:19:14,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:14,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:14,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:19:14,151 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:14,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:14,151 INFO L85 PathProgramCache]: Analyzing trace with hash -649389773, now seen corresponding path program 1 times [2024-10-12 20:19:14,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:14,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24700502] [2024-10-12 20:19:14,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:14,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:14,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:14,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24700502] [2024-10-12 20:19:14,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24700502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:14,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:14,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:19:14,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355696608] [2024-10-12 20:19:14,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:14,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:19:14,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:14,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:19:14,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:19:14,354 INFO L87 Difference]: Start difference. First operand 2948 states and 4088 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:14,877 INFO L93 Difference]: Finished difference Result 5929 states and 8314 transitions. [2024-10-12 20:19:14,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:19:14,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-12 20:19:14,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:14,890 INFO L225 Difference]: With dead ends: 5929 [2024-10-12 20:19:14,890 INFO L226 Difference]: Without dead ends: 4122 [2024-10-12 20:19:14,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:19:14,893 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 1505 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:14,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 985 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:19:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4122 states. [2024-10-12 20:19:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4122 to 2919. [2024-10-12 20:19:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2915 states have (on average 1.388336192109777) internal successors, (4047), 2918 states have internal predecessors, (4047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4047 transitions. [2024-10-12 20:19:14,935 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 4047 transitions. Word has length 54 [2024-10-12 20:19:14,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:14,935 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 4047 transitions. [2024-10-12 20:19:14,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 4047 transitions. [2024-10-12 20:19:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:19:14,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:14,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:14,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:19:14,937 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:14,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:14,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2094955992, now seen corresponding path program 1 times [2024-10-12 20:19:14,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:14,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557943413] [2024-10-12 20:19:14,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:14,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:15,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:15,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557943413] [2024-10-12 20:19:15,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557943413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:15,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:15,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:19:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754422520] [2024-10-12 20:19:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:15,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:19:15,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:15,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:19:15,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:19:15,131 INFO L87 Difference]: Start difference. First operand 2919 states and 4047 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:15,573 INFO L93 Difference]: Finished difference Result 4381 states and 6097 transitions. [2024-10-12 20:19:15,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:19:15,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-12 20:19:15,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:15,578 INFO L225 Difference]: With dead ends: 4381 [2024-10-12 20:19:15,578 INFO L226 Difference]: Without dead ends: 4376 [2024-10-12 20:19:15,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:19:15,579 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 1510 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:15,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1067 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4376 states. [2024-10-12 20:19:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4376 to 2919. [2024-10-12 20:19:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2915 states have (on average 1.3876500857632934) internal successors, (4045), 2918 states have internal predecessors, (4045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4045 transitions. [2024-10-12 20:19:15,612 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 4045 transitions. Word has length 54 [2024-10-12 20:19:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:15,612 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 4045 transitions. [2024-10-12 20:19:15,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 4045 transitions. [2024-10-12 20:19:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:19:15,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:15,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:15,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:19:15,614 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:15,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:15,615 INFO L85 PathProgramCache]: Analyzing trace with hash -544921047, now seen corresponding path program 1 times [2024-10-12 20:19:15,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:15,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660438979] [2024-10-12 20:19:15,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:15,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:15,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:15,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660438979] [2024-10-12 20:19:15,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660438979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:15,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:15,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:15,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256834831] [2024-10-12 20:19:15,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:15,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:15,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:15,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:15,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:15,661 INFO L87 Difference]: Start difference. First operand 2919 states and 4045 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:15,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:15,695 INFO L93 Difference]: Finished difference Result 4192 states and 5856 transitions. [2024-10-12 20:19:15,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:15,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-12 20:19:15,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:15,698 INFO L225 Difference]: With dead ends: 4192 [2024-10-12 20:19:15,698 INFO L226 Difference]: Without dead ends: 2926 [2024-10-12 20:19:15,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:15,700 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 224 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:15,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 795 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2024-10-12 20:19:15,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 2919. [2024-10-12 20:19:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2915 states have (on average 1.3739279588336193) internal successors, (4005), 2918 states have internal predecessors, (4005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:15,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4005 transitions. [2024-10-12 20:19:15,722 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 4005 transitions. Word has length 55 [2024-10-12 20:19:15,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:15,722 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 4005 transitions. [2024-10-12 20:19:15,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:15,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 4005 transitions. [2024-10-12 20:19:15,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:19:15,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:15,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:15,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:19:15,724 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:15,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:15,724 INFO L85 PathProgramCache]: Analyzing trace with hash -171324051, now seen corresponding path program 1 times [2024-10-12 20:19:15,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:15,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445697998] [2024-10-12 20:19:15,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:15,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:15,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:15,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445697998] [2024-10-12 20:19:15,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445697998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:15,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:15,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:15,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244700020] [2024-10-12 20:19:15,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:15,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:15,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:15,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:15,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:15,765 INFO L87 Difference]: Start difference. First operand 2919 states and 4005 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:15,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:15,790 INFO L93 Difference]: Finished difference Result 4259 states and 5888 transitions. [2024-10-12 20:19:15,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:15,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-12 20:19:15,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:15,793 INFO L225 Difference]: With dead ends: 4259 [2024-10-12 20:19:15,793 INFO L226 Difference]: Without dead ends: 2925 [2024-10-12 20:19:15,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:15,795 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 240 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:15,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 800 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:15,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2024-10-12 20:19:15,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2919. [2024-10-12 20:19:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2915 states have (on average 1.3615780445969126) internal successors, (3969), 2918 states have internal predecessors, (3969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 3969 transitions. [2024-10-12 20:19:15,817 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 3969 transitions. Word has length 55 [2024-10-12 20:19:15,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:15,817 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 3969 transitions. [2024-10-12 20:19:15,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 3969 transitions. [2024-10-12 20:19:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:19:15,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:15,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:15,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:19:15,819 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:15,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:15,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1692855010, now seen corresponding path program 1 times [2024-10-12 20:19:15,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:15,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20634869] [2024-10-12 20:19:15,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:15,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:15,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-10-12 20:19:15,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:15,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20634869] [2024-10-12 20:19:15,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20634869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:15,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:15,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:15,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757172662] [2024-10-12 20:19:15,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:15,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:15,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:15,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:15,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:15,866 INFO L87 Difference]: Start difference. First operand 2919 states and 3969 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:15,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:15,895 INFO L93 Difference]: Finished difference Result 4009 states and 5457 transitions. [2024-10-12 20:19:15,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:15,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-12 20:19:15,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:15,899 INFO L225 Difference]: With dead ends: 4009 [2024-10-12 20:19:15,899 INFO L226 Difference]: Without dead ends: 2910 [2024-10-12 20:19:15,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:15,900 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 259 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:15,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 811 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:15,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2024-10-12 20:19:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2904. [2024-10-12 20:19:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2904 states, 2900 states have (on average 1.3341379310344827) internal successors, (3869), 2903 states have internal predecessors, (3869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2904 states and 3869 transitions. [2024-10-12 20:19:15,956 INFO L78 Accepts]: Start accepts. Automaton has 2904 states and 3869 transitions. Word has length 55 [2024-10-12 20:19:15,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:15,956 INFO L471 AbstractCegarLoop]: Abstraction has 2904 states and 3869 transitions. [2024-10-12 20:19:15,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 3869 transitions. [2024-10-12 20:19:15,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 20:19:15,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:15,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:15,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:19:15,958 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:15,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1901622388, now seen corresponding path program 1 times [2024-10-12 20:19:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:15,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331283259] [2024-10-12 20:19:15,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:15,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:15,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:15,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331283259] [2024-10-12 20:19:15,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331283259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:15,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:15,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:15,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74806884] [2024-10-12 20:19:15,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:15,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:15,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:15,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:15,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:15,992 INFO L87 Difference]: Start difference. First operand 2904 states and 3869 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:16,039 INFO L93 Difference]: Finished difference Result 4582 states and 6151 transitions. [2024-10-12 20:19:16,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:16,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-12 20:19:16,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:16,043 INFO L225 Difference]: With dead ends: 4582 [2024-10-12 20:19:16,043 INFO L226 Difference]: Without dead ends: 3322 [2024-10-12 20:19:16,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:16,045 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 324 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:16,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 530 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2024-10-12 20:19:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 2722. [2024-10-12 20:19:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 2718 states have (on average 1.336644591611479) internal successors, (3633), 2721 states have internal predecessors, (3633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 3633 transitions. [2024-10-12 20:19:16,066 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 3633 transitions. Word has length 56 [2024-10-12 20:19:16,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:16,066 INFO L471 AbstractCegarLoop]: Abstraction has 2722 states and 3633 transitions. [2024-10-12 20:19:16,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 3633 transitions. [2024-10-12 20:19:16,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 20:19:16,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:16,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:16,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:19:16,068 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:16,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:16,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1344491359, now seen corresponding path program 1 times [2024-10-12 20:19:16,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:16,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112590074] [2024-10-12 20:19:16,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:16,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:16,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:16,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112590074] [2024-10-12 20:19:16,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112590074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:16,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:16,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:19:16,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72915370] [2024-10-12 20:19:16,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:16,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:19:16,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:16,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:19:16,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:19:16,550 INFO L87 Difference]: Start difference. First operand 2722 states and 3633 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:17,099 INFO L93 Difference]: Finished difference Result 3963 states and 5340 transitions. [2024-10-12 20:19:17,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:19:17,099 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-12 20:19:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:17,104 INFO L225 Difference]: With dead ends: 3963 [2024-10-12 20:19:17,104 INFO L226 Difference]: Without dead ends: 3959 [2024-10-12 20:19:17,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:19:17,105 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 1900 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1900 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:17,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1900 Valid, 2492 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3959 states. [2024-10-12 20:19:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3959 to 2718. [2024-10-12 20:19:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2718 states, 2715 states have (on average 1.336279926335175) internal successors, (3628), 2717 states have internal predecessors, (3628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 3628 transitions. [2024-10-12 20:19:17,127 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 3628 transitions. Word has length 57 [2024-10-12 20:19:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:17,127 INFO L471 AbstractCegarLoop]: Abstraction has 2718 states and 3628 transitions. [2024-10-12 20:19:17,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 3628 transitions. [2024-10-12 20:19:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 20:19:17,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:17,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:17,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:19:17,129 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:17,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:17,129 INFO L85 PathProgramCache]: Analyzing trace with hash 972832554, now seen corresponding path program 1 times [2024-10-12 20:19:17,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:17,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183931214] [2024-10-12 20:19:17,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:17,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:17,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:17,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183931214] [2024-10-12 20:19:17,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183931214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:17,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:17,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-12 20:19:17,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902534986] [2024-10-12 20:19:17,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:17,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 20:19:17,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:17,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 20:19:17,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:19:17,831 INFO L87 Difference]: Start difference. First operand 2718 states and 3628 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:19,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:19,228 INFO L93 Difference]: Finished difference Result 4136 states and 5537 transitions. [2024-10-12 20:19:19,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 20:19:19,228 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-12 20:19:19,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:19,233 INFO L225 Difference]: With dead ends: 4136 [2024-10-12 20:19:19,233 INFO L226 Difference]: Without dead ends: 4130 [2024-10-12 20:19:19,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 20:19:19,235 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 2763 mSDsluCounter, 3516 mSDsCounter, 0 mSdLazyCounter, 2104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2763 SdHoareTripleChecker+Valid, 3853 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:19,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2763 Valid, 3853 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2104 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:19:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4130 states. [2024-10-12 20:19:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4130 to 2718. [2024-10-12 20:19:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2718 states, 2715 states have (on average 1.3359116022099446) internal successors, (3627), 2717 states have internal predecessors, (3627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 3627 transitions. [2024-10-12 20:19:19,259 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 3627 transitions. Word has length 57 [2024-10-12 20:19:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:19,260 INFO L471 AbstractCegarLoop]: Abstraction has 2718 states and 3627 transitions. [2024-10-12 20:19:19,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 3627 transitions. [2024-10-12 20:19:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 20:19:19,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:19,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:19,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:19:19,262 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:19,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:19,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1505907758, now seen corresponding path program 1 times [2024-10-12 20:19:19,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:19,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591642038] [2024-10-12 20:19:19,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:19,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:19,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:19,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:19,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591642038] [2024-10-12 20:19:19,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591642038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:19,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:19,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:19:19,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617118943] [2024-10-12 20:19:19,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:19,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:19:19,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:19,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:19:19,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:19:19,620 INFO L87 Difference]: Start difference. First operand 2718 states and 3627 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:20,096 INFO L93 Difference]: Finished difference Result 3665 states and 4914 transitions. [2024-10-12 20:19:20,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:19:20,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-12 20:19:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:20,100 INFO L225 Difference]: With dead ends: 3665 [2024-10-12 20:19:20,100 INFO L226 Difference]: Without dead ends: 3554 [2024-10-12 20:19:20,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:19:20,101 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 2061 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:20,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2061 Valid, 2227 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:19:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2024-10-12 20:19:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 2703. [2024-10-12 20:19:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2703 states, 2701 states have (on average 1.3365420214735284) internal successors, (3610), 2702 states have internal predecessors, (3610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 3610 transitions. [2024-10-12 20:19:20,123 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 3610 transitions. Word has length 57 [2024-10-12 20:19:20,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:20,123 INFO L471 AbstractCegarLoop]: Abstraction has 2703 states and 3610 transitions. [2024-10-12 20:19:20,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 3610 transitions. [2024-10-12 20:19:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 20:19:20,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:20,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:20,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:19:20,125 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:20,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:20,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1509363809, now seen corresponding path program 1 times [2024-10-12 20:19:20,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:20,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462344971] [2024-10-12 20:19:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:20,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:20,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:20,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462344971] [2024-10-12 20:19:20,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462344971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:20,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:20,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:19:20,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025387594] [2024-10-12 20:19:20,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:20,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:19:20,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:20,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:19:20,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:19:20,494 INFO L87 Difference]: Start difference. First operand 2703 states and 3610 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:21,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:21,051 INFO L93 Difference]: Finished difference Result 3944 states and 5317 transitions. [2024-10-12 20:19:21,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:19:21,051 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-12 20:19:21,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:21,056 INFO L225 Difference]: With dead ends: 3944 [2024-10-12 20:19:21,056 INFO L226 Difference]: Without dead ends: 3940 [2024-10-12 20:19:21,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:19:21,058 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 2167 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2167 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:21,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2167 Valid, 2197 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:21,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2024-10-12 20:19:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 2703. [2024-10-12 20:19:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2703 states, 2701 states have (on average 1.3361717882265827) internal successors, (3609), 2702 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 3609 transitions. [2024-10-12 20:19:21,087 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 3609 transitions. Word has length 57 [2024-10-12 20:19:21,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:21,087 INFO L471 AbstractCegarLoop]: Abstraction has 2703 states and 3609 transitions. [2024-10-12 20:19:21,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 3609 transitions. [2024-10-12 20:19:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 20:19:21,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:21,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:21,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:19:21,089 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:21,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1989309034, now seen corresponding path program 1 times [2024-10-12 20:19:21,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:21,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949866585] [2024-10-12 20:19:21,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:21,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949866585] [2024-10-12 20:19:21,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949866585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:21,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:21,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:21,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092377493] [2024-10-12 20:19:21,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:21,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:21,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:21,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:21,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:21,126 INFO L87 Difference]: Start difference. First operand 2703 states and 3609 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:21,167 INFO L93 Difference]: Finished difference Result 4959 states and 6680 transitions. [2024-10-12 20:19:21,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:21,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-12 20:19:21,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:21,170 INFO L225 Difference]: With dead ends: 4959 [2024-10-12 20:19:21,170 INFO L226 Difference]: Without dead ends: 3311 [2024-10-12 20:19:21,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:21,172 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 281 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:21,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 472 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:21,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3311 states. [2024-10-12 20:19:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3311 to 2595. [2024-10-12 20:19:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 2594 states have (on average 1.3365458750963763) internal successors, (3467), 2594 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3467 transitions. [2024-10-12 20:19:21,194 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3467 transitions. Word has length 57 [2024-10-12 20:19:21,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:21,195 INFO L471 AbstractCegarLoop]: Abstraction has 2595 states and 3467 transitions. [2024-10-12 20:19:21,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3467 transitions. [2024-10-12 20:19:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 20:19:21,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:21,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:21,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:19:21,227 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:21,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:21,227 INFO L85 PathProgramCache]: Analyzing trace with hash -65378401, now seen corresponding path program 1 times [2024-10-12 20:19:21,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:21,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982756049] [2024-10-12 20:19:21,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:21,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:21,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:21,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982756049] [2024-10-12 20:19:21,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982756049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:21,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:21,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:21,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339602893] [2024-10-12 20:19:21,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:21,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:21,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:21,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:21,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:21,317 INFO L87 Difference]: Start difference. First operand 2595 states and 3467 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:21,388 INFO L93 Difference]: Finished difference Result 6286 states and 8638 transitions. [2024-10-12 20:19:21,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:21,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-12 20:19:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:21,394 INFO L225 Difference]: With dead ends: 6286 [2024-10-12 20:19:21,394 INFO L226 Difference]: Without dead ends: 4775 [2024-10-12 20:19:21,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:21,397 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 1032 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:21,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 834 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2024-10-12 20:19:21,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4036. [2024-10-12 20:19:21,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4036 states, 4035 states have (on average 1.3407682775712515) internal successors, (5410), 4035 states have internal predecessors, (5410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 5410 transitions. [2024-10-12 20:19:21,448 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 5410 transitions. Word has length 67 [2024-10-12 20:19:21,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:21,448 INFO L471 AbstractCegarLoop]: Abstraction has 4036 states and 5410 transitions. [2024-10-12 20:19:21,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 5410 transitions. [2024-10-12 20:19:21,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 20:19:21,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:21,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:21,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:19:21,453 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:21,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:21,453 INFO L85 PathProgramCache]: Analyzing trace with hash -510700073, now seen corresponding path program 1 times [2024-10-12 20:19:21,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:21,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924062276] [2024-10-12 20:19:21,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:21,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:21,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:21,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924062276] [2024-10-12 20:19:21,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924062276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:21,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:21,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:21,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444561227] [2024-10-12 20:19:21,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:21,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:21,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:21,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:21,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:21,526 INFO L87 Difference]: Start difference. First operand 4036 states and 5410 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-10-12 20:19:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:21,588 INFO L93 Difference]: Finished difference Result 4042 states and 5413 transitions. [2024-10-12 20:19:21,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:21,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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-10-12 20:19:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:21,592 INFO L225 Difference]: With dead ends: 4042 [2024-10-12 20:19:21,592 INFO L226 Difference]: Without dead ends: 3569 [2024-10-12 20:19:21,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:21,593 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 550 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:21,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 964 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:21,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2024-10-12 20:19:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 3565. [2024-10-12 20:19:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3565 states, 3564 states have (on average 1.3451178451178452) internal successors, (4794), 3564 states have internal predecessors, (4794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 4794 transitions. [2024-10-12 20:19:21,616 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 4794 transitions. Word has length 68 [2024-10-12 20:19:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:21,617 INFO L471 AbstractCegarLoop]: Abstraction has 3565 states and 4794 transitions. [2024-10-12 20:19:21,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 4794 transitions. [2024-10-12 20:19:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 20:19:21,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:21,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:21,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:19:21,620 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:21,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:21,621 INFO L85 PathProgramCache]: Analyzing trace with hash 936875869, now seen corresponding path program 1 times [2024-10-12 20:19:21,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:21,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435294534] [2024-10-12 20:19:21,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:21,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:21,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:21,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435294534] [2024-10-12 20:19:21,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435294534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:21,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:21,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:21,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460439085] [2024-10-12 20:19:21,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:21,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:21,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:21,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:21,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:21,688 INFO L87 Difference]: Start difference. First operand 3565 states and 4794 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:21,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:21,721 INFO L93 Difference]: Finished difference Result 8183 states and 11146 transitions. [2024-10-12 20:19:21,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:21,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-12 20:19:21,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:21,727 INFO L225 Difference]: With dead ends: 8183 [2024-10-12 20:19:21,727 INFO L226 Difference]: Without dead ends: 5549 [2024-10-12 20:19:21,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:21,729 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 158 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:21,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 584 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5549 states. [2024-10-12 20:19:21,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5549 to 5231. [2024-10-12 20:19:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5231 states, 5230 states have (on average 1.3353728489483747) internal successors, (6984), 5230 states have internal predecessors, (6984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 6984 transitions. [2024-10-12 20:19:21,769 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 6984 transitions. Word has length 69 [2024-10-12 20:19:21,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:21,769 INFO L471 AbstractCegarLoop]: Abstraction has 5231 states and 6984 transitions. [2024-10-12 20:19:21,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 6984 transitions. [2024-10-12 20:19:21,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 20:19:21,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:21,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:21,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:19:21,772 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:21,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:21,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1521240512, now seen corresponding path program 1 times [2024-10-12 20:19:21,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:21,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055259204] [2024-10-12 20:19:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:21,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055259204] [2024-10-12 20:19:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055259204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:21,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:21,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211026673] [2024-10-12 20:19:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:21,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:21,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:21,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:21,864 INFO L87 Difference]: Start difference. First operand 5231 states and 6984 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-10-12 20:19:21,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:21,901 INFO L93 Difference]: Finished difference Result 13351 states and 18086 transitions. [2024-10-12 20:19:21,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:21,902 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-10-12 20:19:21,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:21,911 INFO L225 Difference]: With dead ends: 13351 [2024-10-12 20:19:21,912 INFO L226 Difference]: Without dead ends: 9091 [2024-10-12 20:19:21,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:21,917 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 138 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:21,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 580 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:21,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9091 states. [2024-10-12 20:19:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9091 to 8481. [2024-10-12 20:19:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8481 states, 8480 states have (on average 1.3403301886792454) internal successors, (11366), 8480 states have internal predecessors, (11366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8481 states to 8481 states and 11366 transitions. [2024-10-12 20:19:21,992 INFO L78 Accepts]: Start accepts. Automaton has 8481 states and 11366 transitions. Word has length 70 [2024-10-12 20:19:21,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:21,992 INFO L471 AbstractCegarLoop]: Abstraction has 8481 states and 11366 transitions. [2024-10-12 20:19:21,992 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-10-12 20:19:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 8481 states and 11366 transitions. [2024-10-12 20:19:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:19:21,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:21,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:21,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 20:19:21,995 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:21,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:21,996 INFO L85 PathProgramCache]: Analyzing trace with hash -665898309, now seen corresponding path program 1 times [2024-10-12 20:19:21,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:21,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618392823] [2024-10-12 20:19:21,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:21,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:22,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:22,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618392823] [2024-10-12 20:19:22,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618392823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:22,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:22,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:22,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597257682] [2024-10-12 20:19:22,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:22,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:22,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:22,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:22,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:22,064 INFO L87 Difference]: Start difference. First operand 8481 states and 11366 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:22,128 INFO L93 Difference]: Finished difference Result 22701 states and 30624 transitions. [2024-10-12 20:19:22,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:22,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-12 20:19:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:22,144 INFO L225 Difference]: With dead ends: 22701 [2024-10-12 20:19:22,144 INFO L226 Difference]: Without dead ends: 15191 [2024-10-12 20:19:22,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:22,153 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 106 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:22,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 579 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15191 states. [2024-10-12 20:19:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15191 to 13717. [2024-10-12 20:19:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13717 states, 13716 states have (on average 1.3323126275882182) internal successors, (18274), 13716 states have internal predecessors, (18274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13717 states to 13717 states and 18274 transitions. [2024-10-12 20:19:22,283 INFO L78 Accepts]: Start accepts. Automaton has 13717 states and 18274 transitions. Word has length 72 [2024-10-12 20:19:22,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:22,283 INFO L471 AbstractCegarLoop]: Abstraction has 13717 states and 18274 transitions. [2024-10-12 20:19:22,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:22,283 INFO L276 IsEmpty]: Start isEmpty. Operand 13717 states and 18274 transitions. [2024-10-12 20:19:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:19:22,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:22,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:22,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 20:19:22,286 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:22,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash 93568553, now seen corresponding path program 1 times [2024-10-12 20:19:22,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:22,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216044722] [2024-10-12 20:19:22,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:22,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:22,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:22,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216044722] [2024-10-12 20:19:22,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216044722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:22,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:22,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:19:22,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016794112] [2024-10-12 20:19:22,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:22,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:19:22,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:22,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:19:22,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:19:22,475 INFO L87 Difference]: Start difference. First operand 13717 states and 18274 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 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-10-12 20:19:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:22,532 INFO L93 Difference]: Finished difference Result 15063 states and 20067 transitions. [2024-10-12 20:19:22,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:19:22,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 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-10-12 20:19:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:22,547 INFO L225 Difference]: With dead ends: 15063 [2024-10-12 20:19:22,548 INFO L226 Difference]: Without dead ends: 15061 [2024-10-12 20:19:22,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:19:22,552 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:22,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1445 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15061 states. [2024-10-12 20:19:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15061 to 15061. [2024-10-12 20:19:22,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15061 states, 15060 states have (on average 1.30265604249668) internal successors, (19618), 15060 states have internal predecessors, (19618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15061 states to 15061 states and 19618 transitions. [2024-10-12 20:19:22,687 INFO L78 Accepts]: Start accepts. Automaton has 15061 states and 19618 transitions. Word has length 74 [2024-10-12 20:19:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:22,687 INFO L471 AbstractCegarLoop]: Abstraction has 15061 states and 19618 transitions. [2024-10-12 20:19:22,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 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-10-12 20:19:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 15061 states and 19618 transitions. [2024-10-12 20:19:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:19:22,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:22,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:22,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 20:19:22,690 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:22,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1179448625, now seen corresponding path program 1 times [2024-10-12 20:19:22,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:22,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154135984] [2024-10-12 20:19:22,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:22,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:22,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:22,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:22,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154135984] [2024-10-12 20:19:22,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154135984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:22,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:22,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:22,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435892523] [2024-10-12 20:19:22,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:22,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:22,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:22,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:22,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:22,728 INFO L87 Difference]: Start difference. First operand 15061 states and 19618 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:22,868 INFO L93 Difference]: Finished difference Result 36257 states and 47212 transitions. [2024-10-12 20:19:22,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:22,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-12 20:19:22,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:22,890 INFO L225 Difference]: With dead ends: 36257 [2024-10-12 20:19:22,890 INFO L226 Difference]: Without dead ends: 22167 [2024-10-12 20:19:22,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:22,898 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 192 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:22,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 466 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:22,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22167 states. [2024-10-12 20:19:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22167 to 22165. [2024-10-12 20:19:23,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22165 states, 22164 states have (on average 1.2857787402995848) internal successors, (28498), 22164 states have internal predecessors, (28498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22165 states to 22165 states and 28498 transitions. [2024-10-12 20:19:23,077 INFO L78 Accepts]: Start accepts. Automaton has 22165 states and 28498 transitions. Word has length 75 [2024-10-12 20:19:23,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:23,077 INFO L471 AbstractCegarLoop]: Abstraction has 22165 states and 28498 transitions. [2024-10-12 20:19:23,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 22165 states and 28498 transitions. [2024-10-12 20:19:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:19:23,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:23,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:23,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 20:19:23,080 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:23,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:23,081 INFO L85 PathProgramCache]: Analyzing trace with hash 667979649, now seen corresponding path program 1 times [2024-10-12 20:19:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:23,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029386325] [2024-10-12 20:19:23,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:23,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:23,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:23,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029386325] [2024-10-12 20:19:23,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029386325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:23,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:23,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:23,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564509086] [2024-10-12 20:19:23,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:23,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:23,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:23,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:23,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:23,159 INFO L87 Difference]: Start difference. First operand 22165 states and 28498 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:23,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:23,266 INFO L93 Difference]: Finished difference Result 32577 states and 42113 transitions. [2024-10-12 20:19:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:23,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-12 20:19:23,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:23,296 INFO L225 Difference]: With dead ends: 32577 [2024-10-12 20:19:23,296 INFO L226 Difference]: Without dead ends: 27811 [2024-10-12 20:19:23,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:23,309 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 654 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:23,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 947 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:23,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27811 states. [2024-10-12 20:19:23,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27811 to 25291. [2024-10-12 20:19:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25291 states, 25290 states have (on average 1.2827204428627916) internal successors, (32440), 25290 states have internal predecessors, (32440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25291 states to 25291 states and 32440 transitions. [2024-10-12 20:19:23,754 INFO L78 Accepts]: Start accepts. Automaton has 25291 states and 32440 transitions. Word has length 76 [2024-10-12 20:19:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:23,754 INFO L471 AbstractCegarLoop]: Abstraction has 25291 states and 32440 transitions. [2024-10-12 20:19:23,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 25291 states and 32440 transitions. [2024-10-12 20:19:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 20:19:23,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:23,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:23,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 20:19:23,758 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:23,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1316845845, now seen corresponding path program 1 times [2024-10-12 20:19:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:23,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302194565] [2024-10-12 20:19:23,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:23,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:23,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:23,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302194565] [2024-10-12 20:19:23,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302194565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:23,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:23,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:23,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048983797] [2024-10-12 20:19:23,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:23,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:23,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:23,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:23,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:23,934 INFO L87 Difference]: Start difference. First operand 25291 states and 32440 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:24,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:24,034 INFO L93 Difference]: Finished difference Result 34173 states and 44077 transitions. [2024-10-12 20:19:24,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:24,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-12 20:19:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:24,069 INFO L225 Difference]: With dead ends: 34173 [2024-10-12 20:19:24,069 INFO L226 Difference]: Without dead ends: 29311 [2024-10-12 20:19:24,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:24,081 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 668 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:24,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 907 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:24,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29311 states. [2024-10-12 20:19:24,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29311 to 28465. [2024-10-12 20:19:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28465 states, 28464 states have (on average 1.2806703204047218) internal successors, (36453), 28464 states have internal predecessors, (36453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28465 states to 28465 states and 36453 transitions. [2024-10-12 20:19:24,494 INFO L78 Accepts]: Start accepts. Automaton has 28465 states and 36453 transitions. Word has length 78 [2024-10-12 20:19:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:24,494 INFO L471 AbstractCegarLoop]: Abstraction has 28465 states and 36453 transitions. [2024-10-12 20:19:24,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 28465 states and 36453 transitions. [2024-10-12 20:19:24,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:19:24,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:24,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:24,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-12 20:19:24,501 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:24,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:24,501 INFO L85 PathProgramCache]: Analyzing trace with hash 137897756, now seen corresponding path program 1 times [2024-10-12 20:19:24,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:24,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913298473] [2024-10-12 20:19:24,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:24,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:24,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:24,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913298473] [2024-10-12 20:19:24,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913298473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:24,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:24,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:24,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921451744] [2024-10-12 20:19:24,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:24,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:24,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:24,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:24,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:24,547 INFO L87 Difference]: Start difference. First operand 28465 states and 36453 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:24,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:24,687 INFO L93 Difference]: Finished difference Result 56123 states and 71898 transitions. [2024-10-12 20:19:24,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:24,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-12 20:19:24,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:24,734 INFO L225 Difference]: With dead ends: 56123 [2024-10-12 20:19:24,734 INFO L226 Difference]: Without dead ends: 42013 [2024-10-12 20:19:24,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:24,756 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 233 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:24,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 381 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:24,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42013 states. [2024-10-12 20:19:25,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42013 to 27926. [2024-10-12 20:19:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27926 states, 27925 states have (on average 1.2777797672336615) internal successors, (35682), 27925 states have internal predecessors, (35682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27926 states to 27926 states and 35682 transitions. [2024-10-12 20:19:25,218 INFO L78 Accepts]: Start accepts. Automaton has 27926 states and 35682 transitions. Word has length 79 [2024-10-12 20:19:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:25,218 INFO L471 AbstractCegarLoop]: Abstraction has 27926 states and 35682 transitions. [2024-10-12 20:19:25,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 27926 states and 35682 transitions. [2024-10-12 20:19:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:19:25,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:25,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:25,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-12 20:19:25,222 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:25,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1937862919, now seen corresponding path program 1 times [2024-10-12 20:19:25,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:25,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921566316] [2024-10-12 20:19:25,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:25,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:25,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921566316] [2024-10-12 20:19:25,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921566316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:25,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:25,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:25,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990842094] [2024-10-12 20:19:25,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:25,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:25,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:25,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:25,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:25,321 INFO L87 Difference]: Start difference. First operand 27926 states and 35682 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:25,448 INFO L93 Difference]: Finished difference Result 39646 states and 50998 transitions. [2024-10-12 20:19:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:25,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-12 20:19:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:25,481 INFO L225 Difference]: With dead ends: 39646 [2024-10-12 20:19:25,481 INFO L226 Difference]: Without dead ends: 32588 [2024-10-12 20:19:25,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:25,495 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 632 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:25,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 867 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32588 states. [2024-10-12 20:19:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32588 to 31742. [2024-10-12 20:19:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31742 states, 31741 states have (on average 1.274629028701049) internal successors, (40458), 31741 states have internal predecessors, (40458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31742 states to 31742 states and 40458 transitions. [2024-10-12 20:19:25,874 INFO L78 Accepts]: Start accepts. Automaton has 31742 states and 40458 transitions. Word has length 79 [2024-10-12 20:19:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:25,874 INFO L471 AbstractCegarLoop]: Abstraction has 31742 states and 40458 transitions. [2024-10-12 20:19:25,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 31742 states and 40458 transitions. [2024-10-12 20:19:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:19:25,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:25,881 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:25,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-12 20:19:25,881 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:25,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:25,881 INFO L85 PathProgramCache]: Analyzing trace with hash 710675695, now seen corresponding path program 1 times [2024-10-12 20:19:25,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:25,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721054337] [2024-10-12 20:19:25,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:25,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:26,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:26,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721054337] [2024-10-12 20:19:26,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721054337] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:19:26,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922371072] [2024-10-12 20:19:26,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:26,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:26,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:26,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:19:26,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:19:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:26,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 20:19:26,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:19:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:26,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:19:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:27,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922371072] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:19:27,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:19:27,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2024-10-12 20:19:27,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364524537] [2024-10-12 20:19:27,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:19:27,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 20:19:27,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:27,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 20:19:27,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:19:27,458 INFO L87 Difference]: Start difference. First operand 31742 states and 40458 transitions. Second operand has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:29,429 INFO L93 Difference]: Finished difference Result 102377 states and 130341 transitions. [2024-10-12 20:19:29,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-12 20:19:29,430 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 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 94 [2024-10-12 20:19:29,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:29,505 INFO L225 Difference]: With dead ends: 102377 [2024-10-12 20:19:29,505 INFO L226 Difference]: Without dead ends: 71559 [2024-10-12 20:19:29,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=692, Invalid=2968, Unknown=0, NotChecked=0, Total=3660 [2024-10-12 20:19:29,536 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 2871 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2871 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 2207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:29,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2871 Valid, 2725 Invalid, 2207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 20:19:29,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71559 states. [2024-10-12 20:19:30,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71559 to 46123. [2024-10-12 20:19:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46123 states, 46122 states have (on average 1.272971683795152) internal successors, (58712), 46122 states have internal predecessors, (58712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46123 states to 46123 states and 58712 transitions. [2024-10-12 20:19:30,182 INFO L78 Accepts]: Start accepts. Automaton has 46123 states and 58712 transitions. Word has length 94 [2024-10-12 20:19:30,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:30,183 INFO L471 AbstractCegarLoop]: Abstraction has 46123 states and 58712 transitions. [2024-10-12 20:19:30,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 46123 states and 58712 transitions. [2024-10-12 20:19:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:19:30,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:30,195 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:30,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:19:30,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-12 20:19:30,396 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:30,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:30,396 INFO L85 PathProgramCache]: Analyzing trace with hash -898085845, now seen corresponding path program 1 times [2024-10-12 20:19:30,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:30,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836006839] [2024-10-12 20:19:30,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:30,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:30,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:30,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836006839] [2024-10-12 20:19:30,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836006839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:30,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:30,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:30,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316359969] [2024-10-12 20:19:30,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:30,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:30,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:30,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:30,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:30,474 INFO L87 Difference]: Start difference. First operand 46123 states and 58712 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:31,012 INFO L93 Difference]: Finished difference Result 91918 states and 116802 transitions. [2024-10-12 20:19:31,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:19:31,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-10-12 20:19:31,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:31,078 INFO L225 Difference]: With dead ends: 91918 [2024-10-12 20:19:31,078 INFO L226 Difference]: Without dead ends: 46961 [2024-10-12 20:19:31,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:31,117 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 510 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:31,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 465 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:19:31,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46961 states. [2024-10-12 20:19:31,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46961 to 44155. [2024-10-12 20:19:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44155 states, 44154 states have (on average 1.2487203877338406) internal successors, (55136), 44154 states have internal predecessors, (55136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44155 states to 44155 states and 55136 transitions. [2024-10-12 20:19:31,581 INFO L78 Accepts]: Start accepts. Automaton has 44155 states and 55136 transitions. Word has length 101 [2024-10-12 20:19:31,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:31,581 INFO L471 AbstractCegarLoop]: Abstraction has 44155 states and 55136 transitions. [2024-10-12 20:19:31,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:31,581 INFO L276 IsEmpty]: Start isEmpty. Operand 44155 states and 55136 transitions. [2024-10-12 20:19:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:19:31,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:31,590 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:31,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-12 20:19:31,590 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:31,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:31,591 INFO L85 PathProgramCache]: Analyzing trace with hash 556526912, now seen corresponding path program 1 times [2024-10-12 20:19:31,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:31,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322638395] [2024-10-12 20:19:31,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:31,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:31,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:31,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322638395] [2024-10-12 20:19:31,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322638395] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:19:31,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329201003] [2024-10-12 20:19:31,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:31,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:31,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:31,885 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:19:31,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 20:19:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:32,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 20:19:32,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:19:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:32,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:19:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:32,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329201003] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:19:32,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:19:32,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-10-12 20:19:32,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617895785] [2024-10-12 20:19:32,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:19:32,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 20:19:32,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:32,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 20:19:32,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:19:32,449 INFO L87 Difference]: Start difference. First operand 44155 states and 55136 transitions. Second operand has 14 states, 14 states have (on average 19.571428571428573) internal successors, (274), 14 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:32,952 INFO L93 Difference]: Finished difference Result 98094 states and 122691 transitions. [2024-10-12 20:19:32,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:19:32,953 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.571428571428573) internal successors, (274), 14 states have internal predecessors, (274), 0 states have call successors, (0), 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 101 [2024-10-12 20:19:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:33,013 INFO L225 Difference]: With dead ends: 98094 [2024-10-12 20:19:33,013 INFO L226 Difference]: Without dead ends: 55145 [2024-10-12 20:19:33,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:19:33,050 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 1954 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:33,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1954 Valid, 1064 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:33,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55145 states. [2024-10-12 20:19:33,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55145 to 46889. [2024-10-12 20:19:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46889 states, 46888 states have (on average 1.2270730250810442) internal successors, (57535), 46888 states have internal predecessors, (57535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46889 states to 46889 states and 57535 transitions. [2024-10-12 20:19:33,723 INFO L78 Accepts]: Start accepts. Automaton has 46889 states and 57535 transitions. Word has length 101 [2024-10-12 20:19:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:33,723 INFO L471 AbstractCegarLoop]: Abstraction has 46889 states and 57535 transitions. [2024-10-12 20:19:33,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.571428571428573) internal successors, (274), 14 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 46889 states and 57535 transitions. [2024-10-12 20:19:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 20:19:33,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:33,732 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:33,755 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-10-12 20:19:33,936 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,SelfDestructingSolverStorable34 [2024-10-12 20:19:33,937 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:33,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash -877611464, now seen corresponding path program 1 times [2024-10-12 20:19:33,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:33,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176060752] [2024-10-12 20:19:33,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:33,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:34,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:34,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176060752] [2024-10-12 20:19:34,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176060752] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:19:34,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287962431] [2024-10-12 20:19:34,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:34,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:34,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:34,020 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:19:34,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 20:19:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:34,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 20:19:34,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:19:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:34,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:19:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:34,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287962431] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:19:34,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:19:34,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-10-12 20:19:34,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412422300] [2024-10-12 20:19:34,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:19:34,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 20:19:34,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:34,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 20:19:34,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:19:34,547 INFO L87 Difference]: Start difference. First operand 46889 states and 57535 transitions. Second operand has 14 states, 14 states have (on average 20.071428571428573) internal successors, (281), 14 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:35,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:35,095 INFO L93 Difference]: Finished difference Result 101034 states and 124153 transitions. [2024-10-12 20:19:35,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:19:35,096 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.071428571428573) internal successors, (281), 14 states have internal predecessors, (281), 0 states have call successors, (0), 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 102 [2024-10-12 20:19:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:35,149 INFO L225 Difference]: With dead ends: 101034 [2024-10-12 20:19:35,150 INFO L226 Difference]: Without dead ends: 55208 [2024-10-12 20:19:35,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:19:35,171 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 2284 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2284 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:35,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2284 Valid, 1009 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:19:35,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55208 states. [2024-10-12 20:19:35,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55208 to 49616. [2024-10-12 20:19:35,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49616 states, 49615 states have (on average 1.211931875440895) internal successors, (60130), 49615 states have internal predecessors, (60130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49616 states to 49616 states and 60130 transitions. [2024-10-12 20:19:35,744 INFO L78 Accepts]: Start accepts. Automaton has 49616 states and 60130 transitions. Word has length 102 [2024-10-12 20:19:35,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:35,744 INFO L471 AbstractCegarLoop]: Abstraction has 49616 states and 60130 transitions. [2024-10-12 20:19:35,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.071428571428573) internal successors, (281), 14 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:35,744 INFO L276 IsEmpty]: Start isEmpty. Operand 49616 states and 60130 transitions. [2024-10-12 20:19:35,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 20:19:35,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:35,754 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:35,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 20:19:35,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:35,955 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:35,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:35,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2072384645, now seen corresponding path program 1 times [2024-10-12 20:19:35,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:35,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111008989] [2024-10-12 20:19:35,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:35,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:36,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 20:19:36,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:36,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111008989] [2024-10-12 20:19:36,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111008989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:36,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:36,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:19:36,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446607179] [2024-10-12 20:19:36,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:36,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:19:36,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:36,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:19:36,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:36,089 INFO L87 Difference]: Start difference. First operand 49616 states and 60130 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:36,456 INFO L93 Difference]: Finished difference Result 69256 states and 83198 transitions. [2024-10-12 20:19:36,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:19:36,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 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 103 [2024-10-12 20:19:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:36,512 INFO L225 Difference]: With dead ends: 69256 [2024-10-12 20:19:36,513 INFO L226 Difference]: Without dead ends: 55126 [2024-10-12 20:19:36,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:19:36,538 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1315 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:36,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 461 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:19:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55126 states. [2024-10-12 20:19:37,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55126 to 49534. [2024-10-12 20:19:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49534 states, 49533 states have (on average 1.2119193265095998) internal successors, (60030), 49533 states have internal predecessors, (60030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49534 states to 49534 states and 60030 transitions. [2024-10-12 20:19:37,173 INFO L78 Accepts]: Start accepts. Automaton has 49534 states and 60030 transitions. Word has length 103 [2024-10-12 20:19:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:37,174 INFO L471 AbstractCegarLoop]: Abstraction has 49534 states and 60030 transitions. [2024-10-12 20:19:37,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:37,174 INFO L276 IsEmpty]: Start isEmpty. Operand 49534 states and 60030 transitions. [2024-10-12 20:19:37,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 20:19:37,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:37,181 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:37,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-12 20:19:37,181 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:37,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:37,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1310787706, now seen corresponding path program 1 times [2024-10-12 20:19:37,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:37,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166021861] [2024-10-12 20:19:37,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:37,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 20:19:37,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:37,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166021861] [2024-10-12 20:19:37,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166021861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:37,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:37,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:37,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338937228] [2024-10-12 20:19:37,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:37,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:19:37,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:37,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:19:37,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:19:37,241 INFO L87 Difference]: Start difference. First operand 49534 states and 60030 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:37,707 INFO L93 Difference]: Finished difference Result 121530 states and 147836 transitions. [2024-10-12 20:19:37,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:37,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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 104 [2024-10-12 20:19:37,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:37,785 INFO L225 Difference]: With dead ends: 121530 [2024-10-12 20:19:37,785 INFO L226 Difference]: Without dead ends: 77096 [2024-10-12 20:19:37,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:37,824 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 187 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:37,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 502 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:19:37,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77096 states. [2024-10-12 20:19:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77096 to 51799. [2024-10-12 20:19:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51799 states, 51798 states have (on average 1.2139271786555466) internal successors, (62879), 51798 states have internal predecessors, (62879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51799 states to 51799 states and 62879 transitions. [2024-10-12 20:19:38,509 INFO L78 Accepts]: Start accepts. Automaton has 51799 states and 62879 transitions. Word has length 104 [2024-10-12 20:19:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:38,509 INFO L471 AbstractCegarLoop]: Abstraction has 51799 states and 62879 transitions. [2024-10-12 20:19:38,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 51799 states and 62879 transitions. [2024-10-12 20:19:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 20:19:38,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:38,519 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:38,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-12 20:19:38,519 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:38,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:38,520 INFO L85 PathProgramCache]: Analyzing trace with hash -384560651, now seen corresponding path program 1 times [2024-10-12 20:19:38,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:38,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805421348] [2024-10-12 20:19:38,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:38,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:38,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:38,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805421348] [2024-10-12 20:19:38,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805421348] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:19:38,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898227647] [2024-10-12 20:19:38,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:38,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:38,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:38,735 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:19:38,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 20:19:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:39,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-12 20:19:39,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:19:39,783 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:39,783 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:19:39,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898227647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:39,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:19:39,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 19 [2024-10-12 20:19:39,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144384167] [2024-10-12 20:19:39,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:39,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:19:39,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:39,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:19:39,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-10-12 20:19:39,785 INFO L87 Difference]: Start difference. First operand 51799 states and 62879 transitions. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:40,756 INFO L93 Difference]: Finished difference Result 103962 states and 126155 transitions. [2024-10-12 20:19:40,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 20:19:40,757 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-10-12 20:19:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:40,847 INFO L225 Difference]: With dead ends: 103962 [2024-10-12 20:19:40,847 INFO L226 Difference]: Without dead ends: 80905 [2024-10-12 20:19:40,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2024-10-12 20:19:40,882 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 1001 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:40,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 2038 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:19:40,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80905 states. [2024-10-12 20:19:41,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80905 to 78725. [2024-10-12 20:19:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78725 states, 78724 states have (on average 1.213695950409024) internal successors, (95547), 78724 states have internal predecessors, (95547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78725 states to 78725 states and 95547 transitions. [2024-10-12 20:19:41,876 INFO L78 Accepts]: Start accepts. Automaton has 78725 states and 95547 transitions. Word has length 104 [2024-10-12 20:19:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:41,876 INFO L471 AbstractCegarLoop]: Abstraction has 78725 states and 95547 transitions. [2024-10-12 20:19:41,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 78725 states and 95547 transitions. [2024-10-12 20:19:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 20:19:41,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:41,884 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:41,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 20:19:42,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-12 20:19:42,085 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:42,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:42,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2044134468, now seen corresponding path program 1 times [2024-10-12 20:19:42,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:42,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482432216] [2024-10-12 20:19:42,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:42,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 20:19:42,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:42,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482432216] [2024-10-12 20:19:42,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482432216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:42,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:42,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:42,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927543330] [2024-10-12 20:19:42,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:42,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:19:42,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:42,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:19:42,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:19:42,146 INFO L87 Difference]: Start difference. First operand 78725 states and 95547 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:42,456 INFO L93 Difference]: Finished difference Result 133380 states and 161191 transitions. [2024-10-12 20:19:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:42,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 105 [2024-10-12 20:19:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:42,572 INFO L225 Difference]: With dead ends: 133380 [2024-10-12 20:19:42,572 INFO L226 Difference]: Without dead ends: 111355 [2024-10-12 20:19:42,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:42,610 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 164 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:42,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 644 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:42,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111355 states. [2024-10-12 20:19:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111355 to 89926. [2024-10-12 20:19:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89926 states, 89925 states have (on average 1.2138671114817903) internal successors, (109157), 89925 states have internal predecessors, (109157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89926 states to 89926 states and 109157 transitions. [2024-10-12 20:19:43,844 INFO L78 Accepts]: Start accepts. Automaton has 89926 states and 109157 transitions. Word has length 105 [2024-10-12 20:19:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:43,844 INFO L471 AbstractCegarLoop]: Abstraction has 89926 states and 109157 transitions. [2024-10-12 20:19:43,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 89926 states and 109157 transitions. [2024-10-12 20:19:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 20:19:43,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:43,854 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:43,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-12 20:19:43,854 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:43,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1407572553, now seen corresponding path program 1 times [2024-10-12 20:19:43,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:43,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267741192] [2024-10-12 20:19:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:44,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:44,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:44,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267741192] [2024-10-12 20:19:44,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267741192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:19:44,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959291147] [2024-10-12 20:19:44,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:44,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:44,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:44,249 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:19:44,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 20:19:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:44,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 20:19:44,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:19:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:44,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:19:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:45,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959291147] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:19:45,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:19:45,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2024-10-12 20:19:45,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248714375] [2024-10-12 20:19:45,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:19:45,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-12 20:19:45,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:45,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-12 20:19:45,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2024-10-12 20:19:45,820 INFO L87 Difference]: Start difference. First operand 89926 states and 109157 transitions. Second operand has 32 states, 32 states have (on average 9.28125) internal successors, (297), 31 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:50,862 INFO L93 Difference]: Finished difference Result 320990 states and 384836 transitions. [2024-10-12 20:19:50,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-10-12 20:19:50,862 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 9.28125) internal successors, (297), 31 states have internal predecessors, (297), 0 states have call successors, (0), 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 105 [2024-10-12 20:19:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:51,165 INFO L225 Difference]: With dead ends: 320990 [2024-10-12 20:19:51,165 INFO L226 Difference]: Without dead ends: 274198 [2024-10-12 20:19:51,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7824 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3866, Invalid=20314, Unknown=0, NotChecked=0, Total=24180 [2024-10-12 20:19:51,215 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 5921 mSDsluCounter, 4183 mSDsCounter, 0 mSdLazyCounter, 4585 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5921 SdHoareTripleChecker+Valid, 4544 SdHoareTripleChecker+Invalid, 4735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 4585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:51,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5921 Valid, 4544 Invalid, 4735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 4585 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 20:19:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274198 states. [2024-10-12 20:19:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274198 to 136098. [2024-10-12 20:19:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136098 states, 136097 states have (on average 1.2118195110840062) internal successors, (164925), 136097 states have internal predecessors, (164925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136098 states to 136098 states and 164925 transitions. [2024-10-12 20:19:53,550 INFO L78 Accepts]: Start accepts. Automaton has 136098 states and 164925 transitions. Word has length 105 [2024-10-12 20:19:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:53,550 INFO L471 AbstractCegarLoop]: Abstraction has 136098 states and 164925 transitions. [2024-10-12 20:19:53,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.28125) internal successors, (297), 31 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 136098 states and 164925 transitions. [2024-10-12 20:19:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 20:19:53,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:53,563 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:53,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 20:19:53,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:53,765 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:53,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:53,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1555899345, now seen corresponding path program 1 times [2024-10-12 20:19:53,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:53,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056206682] [2024-10-12 20:19:53,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:53,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 20:19:54,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:54,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056206682] [2024-10-12 20:19:54,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056206682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:54,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:54,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:19:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957358471] [2024-10-12 20:19:54,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:54,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:19:54,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:54,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:19:54,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:19:54,489 INFO L87 Difference]: Start difference. First operand 136098 states and 164925 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:55,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:55,188 INFO L93 Difference]: Finished difference Result 238819 states and 289516 transitions. [2024-10-12 20:19:55,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:19:55,189 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 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 106 [2024-10-12 20:19:55,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:55,349 INFO L225 Difference]: With dead ends: 238819 [2024-10-12 20:19:55,349 INFO L226 Difference]: Without dead ends: 146877 [2024-10-12 20:19:55,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:19:55,425 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1014 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:55,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 778 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:19:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146877 states. [2024-10-12 20:19:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146877 to 135993. [2024-10-12 20:19:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135993 states, 135992 states have (on average 1.2119095240896522) internal successors, (164810), 135992 states have internal predecessors, (164810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135993 states to 135993 states and 164810 transitions. [2024-10-12 20:19:57,127 INFO L78 Accepts]: Start accepts. Automaton has 135993 states and 164810 transitions. Word has length 106 [2024-10-12 20:19:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:57,127 INFO L471 AbstractCegarLoop]: Abstraction has 135993 states and 164810 transitions. [2024-10-12 20:19:57,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 135993 states and 164810 transitions. [2024-10-12 20:19:57,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 20:19:57,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:57,138 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:57,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-12 20:19:57,138 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:19:57,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:57,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1803914390, now seen corresponding path program 1 times [2024-10-12 20:19:57,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:57,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765302018] [2024-10-12 20:19:57,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:19:57,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:57,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765302018] [2024-10-12 20:19:57,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765302018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:57,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:57,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:57,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166427862] [2024-10-12 20:19:57,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:57,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:19:57,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:57,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:19:57,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:19:57,199 INFO L87 Difference]: Start difference. First operand 135993 states and 164810 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:57,626 INFO L93 Difference]: Finished difference Result 180647 states and 217939 transitions. [2024-10-12 20:19:57,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:57,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 107 [2024-10-12 20:19:57,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:58,295 INFO L225 Difference]: With dead ends: 180647 [2024-10-12 20:19:58,295 INFO L226 Difference]: Without dead ends: 168983 [2024-10-12 20:19:58,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:58,333 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 163 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:58,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 626 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:58,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168983 states. [2024-10-12 20:19:59,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168983 to 135956. [2024-10-12 20:19:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135956 states, 135955 states have (on average 1.2119009966533043) internal successors, (164764), 135955 states have internal predecessors, (164764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135956 states to 135956 states and 164764 transitions. [2024-10-12 20:20:00,071 INFO L78 Accepts]: Start accepts. Automaton has 135956 states and 164764 transitions. Word has length 107 [2024-10-12 20:20:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:00,072 INFO L471 AbstractCegarLoop]: Abstraction has 135956 states and 164764 transitions. [2024-10-12 20:20:00,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 135956 states and 164764 transitions. [2024-10-12 20:20:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 20:20:00,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:00,081 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:20:00,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-12 20:20:00,081 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:20:00,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:00,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1167352475, now seen corresponding path program 1 times [2024-10-12 20:20:00,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:00,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662705376] [2024-10-12 20:20:00,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:00,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:00,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:00,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662705376] [2024-10-12 20:20:00,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662705376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:00,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:00,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:20:00,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006071507] [2024-10-12 20:20:00,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:00,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:20:00,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:00,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:20:00,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:00,122 INFO L87 Difference]: Start difference. First operand 135956 states and 164764 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:00,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:00,901 INFO L93 Difference]: Finished difference Result 196323 states and 237693 transitions. [2024-10-12 20:20:00,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:20:00,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-10-12 20:20:00,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:01,048 INFO L225 Difference]: With dead ends: 196323 [2024-10-12 20:20:01,049 INFO L226 Difference]: Without dead ends: 143140 [2024-10-12 20:20:01,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:01,092 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 89 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:01,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 579 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:20:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143140 states. [2024-10-12 20:20:02,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143140 to 142722. [2024-10-12 20:20:02,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142722 states, 142721 states have (on average 1.207460710056684) internal successors, (172330), 142721 states have internal predecessors, (172330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142722 states to 142722 states and 172330 transitions. [2024-10-12 20:20:03,006 INFO L78 Accepts]: Start accepts. Automaton has 142722 states and 172330 transitions. Word has length 107 [2024-10-12 20:20:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:03,007 INFO L471 AbstractCegarLoop]: Abstraction has 142722 states and 172330 transitions. [2024-10-12 20:20:03,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 142722 states and 172330 transitions. [2024-10-12 20:20:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 20:20:03,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:03,019 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:20:03,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-12 20:20:03,020 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-12 20:20:03,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:03,020 INFO L85 PathProgramCache]: Analyzing trace with hash -906614593, now seen corresponding path program 1 times [2024-10-12 20:20:03,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:03,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729565992] [2024-10-12 20:20:03,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:03,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:03,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:03,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729565992] [2024-10-12 20:20:03,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729565992] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:20:03,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607841092] [2024-10-12 20:20:03,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:03,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:20:03,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:20:03,525 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:20:03,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 20:20:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:03,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 20:20:03,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:20:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:04,251 INFO L311 TraceCheckSpWp]: Computing backward predicates...