./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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9a9140492f4e733c378f87636be646ccd8e7d2f60174537e06a80c7020d713fe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:39:55,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:39:55,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:39:55,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:39:55,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:39:55,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:39:55,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:39:55,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:39:55,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:39:55,316 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:39:55,317 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:39:55,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:39:55,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:39:55,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:39:55,318 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:39:55,318 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:39:55,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:39:55,319 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:39:55,319 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:39:55,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:39:55,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:39:55,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:39:55,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:39:55,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:39:55,321 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:39:55,321 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:39:55,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:39:55,322 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:39:55,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:39:55,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:39:55,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:39:55,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:39:55,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:39:55,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:39:55,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:39:55,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:39:55,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:39:55,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:39:55,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:39:55,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:39:55,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:39:55,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:39:55,327 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-clean/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-clean/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 -> 9a9140492f4e733c378f87636be646ccd8e7d2f60174537e06a80c7020d713fe [2024-10-11 03:39:55,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:39:55,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:39:55,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:39:55,527 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:39:55,528 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:39:55,529 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-11 03:39:56,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:39:57,095 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:39:57,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-11 03:39:57,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c5672b5c3/f78fae1e59e2468ebe9ce2d2ef241fda/FLAG9bb7f767a [2024-10-11 03:39:57,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c5672b5c3/f78fae1e59e2468ebe9ce2d2ef241fda [2024-10-11 03:39:57,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:39:57,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:39:57,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:39:57,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:39:57,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:39:57,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:39:57" (1/1) ... [2024-10-11 03:39:57,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eaf847e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:57, skipping insertion in model container [2024-10-11 03:39:57,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:39:57" (1/1) ... [2024-10-11 03:39:57,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:39:57,404 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8635,8648] [2024-10-11 03:39:57,441 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15820,15833] [2024-10-11 03:39:57,495 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18017,18030] [2024-10-11 03:39:57,506 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19041,19054] [2024-10-11 03:39:57,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:39:57,739 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:39:57,799 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8635,8648] [2024-10-11 03:39:57,822 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15820,15833] [2024-10-11 03:39:57,829 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18017,18030] [2024-10-11 03:39:57,833 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19041,19054] [2024-10-11 03:39:57,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:39:57,915 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:39:57,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:57 WrapperNode [2024-10-11 03:39:57,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:39:57,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:39:57,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:39:57,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:39:57,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:57" (1/1) ... [2024-10-11 03:39:57,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:57" (1/1) ... [2024-10-11 03:39:58,024 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2844 [2024-10-11 03:39:58,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:39:58,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:39:58,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:39:58,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:39:58,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:57" (1/1) ... [2024-10-11 03:39:58,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:57" (1/1) ... [2024-10-11 03:39:58,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:57" (1/1) ... [2024-10-11 03:39:58,101 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-11 03:39:58,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:57" (1/1) ... [2024-10-11 03:39:58,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:57" (1/1) ... [2024-10-11 03:39:58,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:57" (1/1) ... [2024-10-11 03:39:58,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:57" (1/1) ... [2024-10-11 03:39:58,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:57" (1/1) ... [2024-10-11 03:39:58,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:57" (1/1) ... [2024-10-11 03:39:58,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:39:58,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:39:58,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:39:58,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:39:58,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:57" (1/1) ... [2024-10-11 03:39:58,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:39:58,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:39:58,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:39:58,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:39:58,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:39:58,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:39:58,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:39:58,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:39:58,413 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:39:58,415 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:39:59,591 INFO L? ?]: Removed 486 outVars from TransFormulas that were not future-live. [2024-10-11 03:39:59,592 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:39:59,626 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:39:59,626 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:39:59,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:39:59 BoogieIcfgContainer [2024-10-11 03:39:59,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:39:59,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:39:59,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:39:59,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:39:59,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:39:57" (1/3) ... [2024-10-11 03:39:59,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b800877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:39:59, skipping insertion in model container [2024-10-11 03:39:59,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:57" (2/3) ... [2024-10-11 03:39:59,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b800877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:39:59, skipping insertion in model container [2024-10-11 03:39:59,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:39:59" (3/3) ... [2024-10-11 03:39:59,633 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-11 03:39:59,645 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:39:59,646 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 03:39:59,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:39:59,768 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;@1745821c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:39:59,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 03:39:59,775 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-11 03:39:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:39:59,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:59,786 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-11 03:39:59,786 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-11 03:39:59,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1875598250, now seen corresponding path program 1 times [2024-10-11 03:39:59,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:59,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312055237] [2024-10-11 03:39:59,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:59,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:00,114 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-11 03:40:00,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:00,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312055237] [2024-10-11 03:40:00,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312055237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:00,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:00,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:00,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553663427] [2024-10-11 03:40:00,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:00,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:00,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:00,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:00,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:00,145 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-11 03:40:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:00,288 INFO L93 Difference]: Finished difference Result 721 states and 1267 transitions. [2024-10-11 03:40:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:00,293 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-11 03:40:00,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:00,307 INFO L225 Difference]: With dead ends: 721 [2024-10-11 03:40:00,308 INFO L226 Difference]: Without dead ends: 570 [2024-10-11 03:40:00,311 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-11 03:40:00,314 INFO L432 NwaCegarLoop]: 859 mSDtfsCounter, 437 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:00,317 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.1s Time] [2024-10-11 03:40:00,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-11 03:40:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 564. [2024-10-11 03:40:00,377 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-11 03:40:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 753 transitions. [2024-10-11 03:40:00,382 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 753 transitions. Word has length 50 [2024-10-11 03:40:00,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:00,383 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 753 transitions. [2024-10-11 03:40:00,383 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-11 03:40:00,384 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 753 transitions. [2024-10-11 03:40:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:40:00,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:00,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] [2024-10-11 03:40:00,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:40:00,391 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-11 03:40:00,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:00,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2061015356, now seen corresponding path program 1 times [2024-10-11 03:40:00,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:00,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767007809] [2024-10-11 03:40:00,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:00,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:00,499 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-11 03:40:00,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:00,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767007809] [2024-10-11 03:40:00,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767007809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:00,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:00,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:00,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163673877] [2024-10-11 03:40:00,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:00,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:00,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:00,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:00,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:00,502 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-11 03:40:00,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:00,566 INFO L93 Difference]: Finished difference Result 993 states and 1378 transitions. [2024-10-11 03:40:00,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:00,567 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-11 03:40:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:00,570 INFO L225 Difference]: With dead ends: 993 [2024-10-11 03:40:00,571 INFO L226 Difference]: Without dead ends: 780 [2024-10-11 03:40:00,572 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-11 03:40:00,573 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:00,574 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.1s Time] [2024-10-11 03:40:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-10-11 03:40:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 773. [2024-10-11 03:40:00,598 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-11 03:40:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1055 transitions. [2024-10-11 03:40:00,601 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1055 transitions. Word has length 50 [2024-10-11 03:40:00,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:00,601 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1055 transitions. [2024-10-11 03:40:00,602 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-11 03:40:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1055 transitions. [2024-10-11 03:40:00,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:40:00,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:00,604 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-11 03:40:00,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:40:00,604 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-11 03:40:00,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2089668058, now seen corresponding path program 1 times [2024-10-11 03:40:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:00,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989330055] [2024-10-11 03:40:00,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:00,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:00,767 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-11 03:40:00,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:00,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989330055] [2024-10-11 03:40:00,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989330055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:00,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:00,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:40:00,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298339458] [2024-10-11 03:40:00,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:00,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:00,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:00,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:00,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:00,770 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-11 03:40:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:01,067 INFO L93 Difference]: Finished difference Result 1715 states and 2414 transitions. [2024-10-11 03:40:01,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:01,068 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-11 03:40:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:01,071 INFO L225 Difference]: With dead ends: 1715 [2024-10-11 03:40:01,071 INFO L226 Difference]: Without dead ends: 1058 [2024-10-11 03:40:01,074 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-11 03:40:01,075 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 1743 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1743 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:01,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1743 Valid, 389 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:40:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-10-11 03:40:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1052. [2024-10-11 03:40:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1048 states have (on average 1.409351145038168) internal successors, (1477), 1051 states have internal predecessors, (1477), 0 states have call successors, (0), 0 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-11 03:40:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1477 transitions. [2024-10-11 03:40:01,097 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1477 transitions. Word has length 50 [2024-10-11 03:40:01,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:01,097 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1477 transitions. [2024-10-11 03:40:01,098 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-11 03:40:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1477 transitions. [2024-10-11 03:40:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:40:01,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:01,100 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-11 03:40:01,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:40:01,100 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-11 03:40:01,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:01,102 INFO L85 PathProgramCache]: Analyzing trace with hash -941949597, now seen corresponding path program 1 times [2024-10-11 03:40:01,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:01,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530238894] [2024-10-11 03:40:01,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:01,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:01,174 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-11 03:40:01,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:01,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530238894] [2024-10-11 03:40:01,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530238894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:01,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:01,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:01,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519822495] [2024-10-11 03:40:01,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:01,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:01,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:01,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:01,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:01,177 INFO L87 Difference]: Start difference. First operand 1052 states and 1477 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-11 03:40:01,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:01,216 INFO L93 Difference]: Finished difference Result 2098 states and 2964 transitions. [2024-10-11 03:40:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:01,217 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-11 03:40:01,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:01,221 INFO L225 Difference]: With dead ends: 2098 [2024-10-11 03:40:01,221 INFO L226 Difference]: Without dead ends: 1398 [2024-10-11 03:40:01,222 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-11 03:40:01,226 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 364 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 927 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-11 03:40:01,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 927 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:01,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-11 03:40:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1384. [2024-10-11 03:40:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1380 states have (on average 1.372463768115942) internal successors, (1894), 1383 states have internal predecessors, (1894), 0 states have call successors, (0), 0 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-11 03:40:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1894 transitions. [2024-10-11 03:40:01,248 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1894 transitions. Word has length 51 [2024-10-11 03:40:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:01,249 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1894 transitions. [2024-10-11 03:40:01,249 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-11 03:40:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1894 transitions. [2024-10-11 03:40:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:40:01,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:01,250 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-11 03:40:01,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:40:01,251 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-11 03:40:01,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1880466014, now seen corresponding path program 1 times [2024-10-11 03:40:01,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:01,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851848329] [2024-10-11 03:40:01,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:01,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:01,414 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-11 03:40:01,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851848329] [2024-10-11 03:40:01,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851848329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:01,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:01,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:40:01,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381283712] [2024-10-11 03:40:01,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:01,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:01,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:01,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:01,418 INFO L87 Difference]: Start difference. First operand 1384 states and 1894 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-11 03:40:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:01,672 INFO L93 Difference]: Finished difference Result 2979 states and 4124 transitions. [2024-10-11 03:40:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:01,673 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-11 03:40:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:01,677 INFO L225 Difference]: With dead ends: 2979 [2024-10-11 03:40:01,678 INFO L226 Difference]: Without dead ends: 1766 [2024-10-11 03:40:01,680 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-11 03:40:01,680 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 1527 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:01,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 365 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:40:01,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2024-10-11 03:40:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1754. [2024-10-11 03:40:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1750 states have (on average 1.3777142857142857) internal successors, (2411), 1753 states have internal predecessors, (2411), 0 states have call successors, (0), 0 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-11 03:40:01,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2411 transitions. [2024-10-11 03:40:01,716 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2411 transitions. Word has length 51 [2024-10-11 03:40:01,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:01,717 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2411 transitions. [2024-10-11 03:40:01,717 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-11 03:40:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2411 transitions. [2024-10-11 03:40:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:40:01,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:01,720 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-11 03:40:01,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:40:01,720 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-11 03:40:01,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:01,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1402460387, now seen corresponding path program 1 times [2024-10-11 03:40:01,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:01,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654733892] [2024-10-11 03:40:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:01,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:01,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:01,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654733892] [2024-10-11 03:40:01,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654733892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:01,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:01,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:40:01,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569906042] [2024-10-11 03:40:01,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:01,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:01,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:01,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:01,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:01,834 INFO L87 Difference]: Start difference. First operand 1754 states and 2411 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-11 03:40:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:02,071 INFO L93 Difference]: Finished difference Result 3899 states and 5392 transitions. [2024-10-11 03:40:02,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:02,071 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-11 03:40:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:02,077 INFO L225 Difference]: With dead ends: 3899 [2024-10-11 03:40:02,077 INFO L226 Difference]: Without dead ends: 2316 [2024-10-11 03:40:02,079 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-11 03:40:02,079 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 1376 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:02,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 333 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:40:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2024-10-11 03:40:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2300. [2024-10-11 03:40:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2300 states, 2296 states have (on average 1.3702090592334495) internal successors, (3146), 2299 states have internal predecessors, (3146), 0 states have call successors, (0), 0 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-11 03:40:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 2300 states and 3146 transitions. [2024-10-11 03:40:02,122 INFO L78 Accepts]: Start accepts. Automaton has 2300 states and 3146 transitions. Word has length 52 [2024-10-11 03:40:02,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:02,123 INFO L471 AbstractCegarLoop]: Abstraction has 2300 states and 3146 transitions. [2024-10-11 03:40:02,123 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-11 03:40:02,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2300 states and 3146 transitions. [2024-10-11 03:40:02,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:40:02,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:02,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] [2024-10-11 03:40:02,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:40:02,125 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-11 03:40:02,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:02,126 INFO L85 PathProgramCache]: Analyzing trace with hash -78307905, now seen corresponding path program 1 times [2024-10-11 03:40:02,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:02,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719303259] [2024-10-11 03:40:02,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:02,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:02,317 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-11 03:40:02,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:02,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719303259] [2024-10-11 03:40:02,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719303259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:02,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:02,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:40:02,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267669981] [2024-10-11 03:40:02,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:02,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:40:02,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:02,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:40:02,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:40:02,319 INFO L87 Difference]: Start difference. First operand 2300 states and 3146 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-11 03:40:02,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:02,623 INFO L93 Difference]: Finished difference Result 4538 states and 6294 transitions. [2024-10-11 03:40:02,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:40:02,623 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-11 03:40:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:02,632 INFO L225 Difference]: With dead ends: 4538 [2024-10-11 03:40:02,632 INFO L226 Difference]: Without dead ends: 3496 [2024-10-11 03:40:02,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:40:02,634 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 1704 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:02,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 581 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:40:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3496 states. [2024-10-11 03:40:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3496 to 2314. [2024-10-11 03:40:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 2310 states have (on average 1.3696969696969696) internal successors, (3164), 2313 states have internal predecessors, (3164), 0 states have call successors, (0), 0 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-11 03:40:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3164 transitions. [2024-10-11 03:40:02,682 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3164 transitions. Word has length 53 [2024-10-11 03:40:02,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:02,682 INFO L471 AbstractCegarLoop]: Abstraction has 2314 states and 3164 transitions. [2024-10-11 03:40:02,682 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-11 03:40:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3164 transitions. [2024-10-11 03:40:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:40:02,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:02,684 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-11 03:40:02,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:40:02,684 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-11 03:40:02,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:02,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1272319552, now seen corresponding path program 1 times [2024-10-11 03:40:02,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:02,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189643804] [2024-10-11 03:40:02,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:02,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:02,873 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-11 03:40:02,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:02,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189643804] [2024-10-11 03:40:02,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189643804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:02,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:02,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:40:02,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79516644] [2024-10-11 03:40:02,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:02,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:40:02,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:02,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:40:02,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:40:02,879 INFO L87 Difference]: Start difference. First operand 2314 states and 3164 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-11 03:40:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:03,248 INFO L93 Difference]: Finished difference Result 4998 states and 6958 transitions. [2024-10-11 03:40:03,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:40:03,249 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-11 03:40:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:03,259 INFO L225 Difference]: With dead ends: 4998 [2024-10-11 03:40:03,259 INFO L226 Difference]: Without dead ends: 4151 [2024-10-11 03:40:03,261 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-11 03:40:03,262 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 1829 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1829 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:03,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1829 Valid, 616 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:40:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4151 states. [2024-10-11 03:40:03,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4151 to 2336. [2024-10-11 03:40:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 2332 states have (on average 1.3700686106346485) internal successors, (3195), 2335 states have internal predecessors, (3195), 0 states have call successors, (0), 0 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-11 03:40:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3195 transitions. [2024-10-11 03:40:03,312 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3195 transitions. Word has length 53 [2024-10-11 03:40:03,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:03,313 INFO L471 AbstractCegarLoop]: Abstraction has 2336 states and 3195 transitions. [2024-10-11 03:40:03,313 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-11 03:40:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3195 transitions. [2024-10-11 03:40:03,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:40:03,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:03,315 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-11 03:40:03,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:40:03,315 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-11 03:40:03,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:03,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1821294495, now seen corresponding path program 1 times [2024-10-11 03:40:03,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:03,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611807644] [2024-10-11 03:40:03,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:03,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:03,438 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-11 03:40:03,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:03,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611807644] [2024-10-11 03:40:03,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611807644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:03,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:03,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:40:03,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865551432] [2024-10-11 03:40:03,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:03,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:40:03,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:03,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:40:03,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:40:03,440 INFO L87 Difference]: Start difference. First operand 2336 states and 3195 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-11 03:40:03,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:03,772 INFO L93 Difference]: Finished difference Result 5832 states and 8112 transitions. [2024-10-11 03:40:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:40:03,773 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-11 03:40:03,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:03,784 INFO L225 Difference]: With dead ends: 5832 [2024-10-11 03:40:03,784 INFO L226 Difference]: Without dead ends: 4864 [2024-10-11 03:40:03,786 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-11 03:40:03,787 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 1951 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1951 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:03,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1951 Valid, 630 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:40:03,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2024-10-11 03:40:03,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 2370. [2024-10-11 03:40:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 2366 states have (on average 1.3689771766694843) internal successors, (3239), 2369 states have internal predecessors, (3239), 0 states have call successors, (0), 0 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-11 03:40:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 3239 transitions. [2024-10-11 03:40:03,827 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 3239 transitions. Word has length 53 [2024-10-11 03:40:03,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:03,827 INFO L471 AbstractCegarLoop]: Abstraction has 2370 states and 3239 transitions. [2024-10-11 03:40:03,827 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-11 03:40:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 3239 transitions. [2024-10-11 03:40:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 03:40:03,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:03,829 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-11 03:40:03,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:40:03,829 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-11 03:40:03,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:03,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1007743463, now seen corresponding path program 1 times [2024-10-11 03:40:03,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:03,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683222969] [2024-10-11 03:40:03,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:03,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:04,035 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-11 03:40:04,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:04,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683222969] [2024-10-11 03:40:04,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683222969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:04,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:04,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:40:04,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990630178] [2024-10-11 03:40:04,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:04,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:40:04,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:04,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:40:04,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:40:04,037 INFO L87 Difference]: Start difference. First operand 2370 states and 3239 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-11 03:40:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:04,447 INFO L93 Difference]: Finished difference Result 4799 states and 6690 transitions. [2024-10-11 03:40:04,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:40:04,447 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-11 03:40:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:04,455 INFO L225 Difference]: With dead ends: 4799 [2024-10-11 03:40:04,455 INFO L226 Difference]: Without dead ends: 3255 [2024-10-11 03:40:04,457 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-11 03:40:04,457 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 1430 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:04,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1430 Valid, 763 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:40:04,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2024-10-11 03:40:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 2283. [2024-10-11 03:40:04,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 2279 states have (on average 1.3677051338306274) internal successors, (3117), 2282 states have internal predecessors, (3117), 0 states have call successors, (0), 0 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-11 03:40:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 3117 transitions. [2024-10-11 03:40:04,489 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 3117 transitions. Word has length 54 [2024-10-11 03:40:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:04,489 INFO L471 AbstractCegarLoop]: Abstraction has 2283 states and 3117 transitions. [2024-10-11 03:40:04,489 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-11 03:40:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3117 transitions. [2024-10-11 03:40:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 03:40:04,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:04,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:04,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:40:04,491 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-11 03:40:04,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:04,491 INFO L85 PathProgramCache]: Analyzing trace with hash -649389773, now seen corresponding path program 1 times [2024-10-11 03:40:04,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:04,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404273958] [2024-10-11 03:40:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:04,675 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-11 03:40:04,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:04,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404273958] [2024-10-11 03:40:04,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404273958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:04,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:04,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:40:04,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887334213] [2024-10-11 03:40:04,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:04,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:40:04,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:04,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:40:04,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:40:04,676 INFO L87 Difference]: Start difference. First operand 2283 states and 3117 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-11 03:40:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:05,212 INFO L93 Difference]: Finished difference Result 4904 states and 6808 transitions. [2024-10-11 03:40:05,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:40:05,213 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-11 03:40:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:05,221 INFO L225 Difference]: With dead ends: 4904 [2024-10-11 03:40:05,221 INFO L226 Difference]: Without dead ends: 3514 [2024-10-11 03:40:05,223 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-11 03:40:05,224 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 1524 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:05,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1048 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:40:05,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2024-10-11 03:40:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 2254. [2024-10-11 03:40:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2250 states have (on average 1.3671111111111112) internal successors, (3076), 2253 states have internal predecessors, (3076), 0 states have call successors, (0), 0 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-11 03:40:05,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3076 transitions. [2024-10-11 03:40:05,288 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3076 transitions. Word has length 54 [2024-10-11 03:40:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:05,288 INFO L471 AbstractCegarLoop]: Abstraction has 2254 states and 3076 transitions. [2024-10-11 03:40:05,289 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-11 03:40:05,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3076 transitions. [2024-10-11 03:40:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 03:40:05,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:05,290 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-11 03:40:05,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:40:05,291 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-11 03:40:05,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:05,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2094955992, now seen corresponding path program 1 times [2024-10-11 03:40:05,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:05,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017873604] [2024-10-11 03:40:05,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:05,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:05,539 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-11 03:40:05,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:05,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017873604] [2024-10-11 03:40:05,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017873604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:05,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:05,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:40:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821563104] [2024-10-11 03:40:05,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:05,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:40:05,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:05,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:40:05,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:40:05,541 INFO L87 Difference]: Start difference. First operand 2254 states and 3076 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-11 03:40:06,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:06,027 INFO L93 Difference]: Finished difference Result 3348 states and 4592 transitions. [2024-10-11 03:40:06,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:40:06,027 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-11 03:40:06,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:06,034 INFO L225 Difference]: With dead ends: 3348 [2024-10-11 03:40:06,034 INFO L226 Difference]: Without dead ends: 3343 [2024-10-11 03:40:06,035 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-11 03:40:06,036 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 1500 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:06,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1067 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:40:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states. [2024-10-11 03:40:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 2254. [2024-10-11 03:40:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2250 states have (on average 1.3662222222222222) internal successors, (3074), 2253 states have internal predecessors, (3074), 0 states have call successors, (0), 0 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-11 03:40:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3074 transitions. [2024-10-11 03:40:06,065 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3074 transitions. Word has length 54 [2024-10-11 03:40:06,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:06,065 INFO L471 AbstractCegarLoop]: Abstraction has 2254 states and 3074 transitions. [2024-10-11 03:40:06,065 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-11 03:40:06,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3074 transitions. [2024-10-11 03:40:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 03:40:06,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:06,067 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-11 03:40:06,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:40:06,067 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-11 03:40:06,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:06,068 INFO L85 PathProgramCache]: Analyzing trace with hash -544921047, now seen corresponding path program 1 times [2024-10-11 03:40:06,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:06,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796041963] [2024-10-11 03:40:06,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:06,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:06,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-11 03:40:06,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:06,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796041963] [2024-10-11 03:40:06,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796041963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:06,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:06,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:06,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918182663] [2024-10-11 03:40:06,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:06,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:06,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:06,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:06,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:06,114 INFO L87 Difference]: Start difference. First operand 2254 states and 3074 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-11 03:40:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:06,150 INFO L93 Difference]: Finished difference Result 3199 states and 4402 transitions. [2024-10-11 03:40:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:06,151 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-11 03:40:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:06,154 INFO L225 Difference]: With dead ends: 3199 [2024-10-11 03:40:06,154 INFO L226 Difference]: Without dead ends: 2261 [2024-10-11 03:40:06,155 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-11 03:40:06,156 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 222 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 789 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-11 03:40:06,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 789 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2024-10-11 03:40:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2254. [2024-10-11 03:40:06,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2250 states have (on average 1.3528888888888888) internal successors, (3044), 2253 states have internal predecessors, (3044), 0 states have call successors, (0), 0 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-11 03:40:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3044 transitions. [2024-10-11 03:40:06,178 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3044 transitions. Word has length 55 [2024-10-11 03:40:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:06,178 INFO L471 AbstractCegarLoop]: Abstraction has 2254 states and 3044 transitions. [2024-10-11 03:40:06,179 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-11 03:40:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3044 transitions. [2024-10-11 03:40:06,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 03:40:06,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:06,180 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-11 03:40:06,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:40:06,181 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-11 03:40:06,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:06,181 INFO L85 PathProgramCache]: Analyzing trace with hash -171324051, now seen corresponding path program 1 times [2024-10-11 03:40:06,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:06,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787065819] [2024-10-11 03:40:06,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:06,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:06,225 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-11 03:40:06,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:06,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787065819] [2024-10-11 03:40:06,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787065819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:06,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:06,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:06,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701952004] [2024-10-11 03:40:06,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:06,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:06,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:06,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:06,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:06,227 INFO L87 Difference]: Start difference. First operand 2254 states and 3044 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-11 03:40:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:06,251 INFO L93 Difference]: Finished difference Result 3256 states and 4434 transitions. [2024-10-11 03:40:06,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:06,252 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-11 03:40:06,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:06,255 INFO L225 Difference]: With dead ends: 3256 [2024-10-11 03:40:06,255 INFO L226 Difference]: Without dead ends: 2260 [2024-10-11 03:40:06,256 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-11 03:40:06,256 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 238 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 794 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-11 03:40:06,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 794 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:06,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2024-10-11 03:40:06,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 2254. [2024-10-11 03:40:06,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2250 states have (on average 1.3404444444444445) internal successors, (3016), 2253 states have internal predecessors, (3016), 0 states have call successors, (0), 0 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-11 03:40:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3016 transitions. [2024-10-11 03:40:06,314 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3016 transitions. Word has length 55 [2024-10-11 03:40:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:06,315 INFO L471 AbstractCegarLoop]: Abstraction has 2254 states and 3016 transitions. [2024-10-11 03:40:06,315 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-11 03:40:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3016 transitions. [2024-10-11 03:40:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 03:40:06,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:06,316 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-11 03:40:06,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:40:06,317 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-11 03:40:06,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:06,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1692855010, now seen corresponding path program 1 times [2024-10-11 03:40:06,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:06,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652513762] [2024-10-11 03:40:06,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:06,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:06,356 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-11 03:40:06,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:06,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652513762] [2024-10-11 03:40:06,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652513762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:06,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:06,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:06,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524756756] [2024-10-11 03:40:06,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:06,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:06,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:06,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:06,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:06,358 INFO L87 Difference]: Start difference. First operand 2254 states and 3016 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-11 03:40:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:06,383 INFO L93 Difference]: Finished difference Result 3344 states and 4504 transitions. [2024-10-11 03:40:06,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:06,383 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-11 03:40:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:06,386 INFO L225 Difference]: With dead ends: 3344 [2024-10-11 03:40:06,386 INFO L226 Difference]: Without dead ends: 2245 [2024-10-11 03:40:06,387 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-11 03:40:06,388 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 257 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 809 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-11 03:40:06,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 809 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2024-10-11 03:40:06,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2239. [2024-10-11 03:40:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2239 states, 2235 states have (on average 1.3208053691275168) internal successors, (2952), 2238 states have internal predecessors, (2952), 0 states have call successors, (0), 0 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-11 03:40:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 2239 states and 2952 transitions. [2024-10-11 03:40:06,407 INFO L78 Accepts]: Start accepts. Automaton has 2239 states and 2952 transitions. Word has length 55 [2024-10-11 03:40:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:06,408 INFO L471 AbstractCegarLoop]: Abstraction has 2239 states and 2952 transitions. [2024-10-11 03:40:06,408 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-11 03:40:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 2952 transitions. [2024-10-11 03:40:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 03:40:06,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:06,409 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-11 03:40:06,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:40:06,409 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-11 03:40:06,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:06,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1901622388, now seen corresponding path program 1 times [2024-10-11 03:40:06,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:06,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687565225] [2024-10-11 03:40:06,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:06,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:06,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:06,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687565225] [2024-10-11 03:40:06,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687565225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:06,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:06,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:06,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632463344] [2024-10-11 03:40:06,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:06,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:06,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:06,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:06,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:06,445 INFO L87 Difference]: Start difference. First operand 2239 states and 2952 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-11 03:40:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:06,493 INFO L93 Difference]: Finished difference Result 4003 states and 5340 transitions. [2024-10-11 03:40:06,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:06,493 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-11 03:40:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:06,496 INFO L225 Difference]: With dead ends: 4003 [2024-10-11 03:40:06,497 INFO L226 Difference]: Without dead ends: 2743 [2024-10-11 03:40:06,498 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-11 03:40:06,498 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 346 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:06,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 546 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:06,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2024-10-11 03:40:06,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 2057. [2024-10-11 03:40:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.3229420360448125) internal successors, (2716), 2056 states have internal predecessors, (2716), 0 states have call successors, (0), 0 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-11 03:40:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2716 transitions. [2024-10-11 03:40:06,517 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2716 transitions. Word has length 56 [2024-10-11 03:40:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:06,517 INFO L471 AbstractCegarLoop]: Abstraction has 2057 states and 2716 transitions. [2024-10-11 03:40:06,518 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-11 03:40:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2716 transitions. [2024-10-11 03:40:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 03:40:06,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:06,519 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-11 03:40:06,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:40:06,519 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-11 03:40:06,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1344491359, now seen corresponding path program 1 times [2024-10-11 03:40:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:06,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954262549] [2024-10-11 03:40:06,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:06,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:06,911 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-11 03:40:06,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:06,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954262549] [2024-10-11 03:40:06,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954262549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:06,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:06,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:40:06,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818497584] [2024-10-11 03:40:06,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:06,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:40:06,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:06,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:40:06,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:40:06,913 INFO L87 Difference]: Start difference. First operand 2057 states and 2716 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-11 03:40:07,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:07,461 INFO L93 Difference]: Finished difference Result 2949 states and 3937 transitions. [2024-10-11 03:40:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:40:07,461 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-11 03:40:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:07,465 INFO L225 Difference]: With dead ends: 2949 [2024-10-11 03:40:07,465 INFO L226 Difference]: Without dead ends: 2945 [2024-10-11 03:40:07,466 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-11 03:40:07,466 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1922 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:07,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1922 Valid, 1858 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:40:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2024-10-11 03:40:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2053. [2024-10-11 03:40:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2050 states have (on average 1.3229268292682927) internal successors, (2712), 2052 states have internal predecessors, (2712), 0 states have call successors, (0), 0 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-11 03:40:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2712 transitions. [2024-10-11 03:40:07,487 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2712 transitions. Word has length 57 [2024-10-11 03:40:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:07,487 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 2712 transitions. [2024-10-11 03:40:07,487 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-11 03:40:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2712 transitions. [2024-10-11 03:40:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 03:40:07,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:07,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, 1, 1, 1] [2024-10-11 03:40:07,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:40:07,489 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-11 03:40:07,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash 972832554, now seen corresponding path program 1 times [2024-10-11 03:40:07,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:07,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155591788] [2024-10-11 03:40:07,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:07,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:07,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:07,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:07,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155591788] [2024-10-11 03:40:07,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155591788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:07,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:07,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:40:07,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515722496] [2024-10-11 03:40:07,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:07,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:40:07,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:07,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:40:07,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:40:07,789 INFO L87 Difference]: Start difference. First operand 2053 states and 2712 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 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-11 03:40:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:08,205 INFO L93 Difference]: Finished difference Result 3146 states and 4206 transitions. [2024-10-11 03:40:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:40:08,206 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 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-11 03:40:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:08,210 INFO L225 Difference]: With dead ends: 3146 [2024-10-11 03:40:08,210 INFO L226 Difference]: Without dead ends: 2920 [2024-10-11 03:40:08,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:40:08,212 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 1578 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:08,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 1472 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:40:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2024-10-11 03:40:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1995. [2024-10-11 03:40:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1993 states have (on average 1.3246362267937781) internal successors, (2640), 1994 states have internal predecessors, (2640), 0 states have call successors, (0), 0 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-11 03:40:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2640 transitions. [2024-10-11 03:40:08,257 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2640 transitions. Word has length 57 [2024-10-11 03:40:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:08,257 INFO L471 AbstractCegarLoop]: Abstraction has 1995 states and 2640 transitions. [2024-10-11 03:40:08,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 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-11 03:40:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2640 transitions. [2024-10-11 03:40:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 03:40:08,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:08,259 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-11 03:40:08,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:40:08,259 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 03:40:08,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:08,260 INFO L85 PathProgramCache]: Analyzing trace with hash -45383322, now seen corresponding path program 1 times [2024-10-11 03:40:08,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:08,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210531293] [2024-10-11 03:40:08,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:08,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:08,297 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-11 03:40:08,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:08,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210531293] [2024-10-11 03:40:08,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210531293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:08,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:08,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:08,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682375775] [2024-10-11 03:40:08,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:08,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:08,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:08,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:08,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:08,299 INFO L87 Difference]: Start difference. First operand 1995 states and 2640 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-11 03:40:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:08,349 INFO L93 Difference]: Finished difference Result 3644 states and 4868 transitions. [2024-10-11 03:40:08,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:08,349 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-11 03:40:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:08,352 INFO L225 Difference]: With dead ends: 3644 [2024-10-11 03:40:08,353 INFO L226 Difference]: Without dead ends: 2400 [2024-10-11 03:40:08,354 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-11 03:40:08,355 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 256 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:08,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 403 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2024-10-11 03:40:08,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 1868. [2024-10-11 03:40:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1867 states have (on average 1.328334226031066) internal successors, (2480), 1867 states have internal predecessors, (2480), 0 states have call successors, (0), 0 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-11 03:40:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2480 transitions. [2024-10-11 03:40:08,373 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2480 transitions. Word has length 57 [2024-10-11 03:40:08,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:08,373 INFO L471 AbstractCegarLoop]: Abstraction has 1868 states and 2480 transitions. [2024-10-11 03:40:08,373 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-11 03:40:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2480 transitions. [2024-10-11 03:40:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:40:08,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:08,375 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-11 03:40:08,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:40:08,376 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 03:40:08,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:08,376 INFO L85 PathProgramCache]: Analyzing trace with hash -65378401, now seen corresponding path program 1 times [2024-10-11 03:40:08,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:08,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117557172] [2024-10-11 03:40:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:08,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:08,442 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-11 03:40:08,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:08,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117557172] [2024-10-11 03:40:08,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117557172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:08,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:08,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:40:08,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661499681] [2024-10-11 03:40:08,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:08,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:08,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:08,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:08,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:08,444 INFO L87 Difference]: Start difference. First operand 1868 states and 2480 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-11 03:40:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:08,502 INFO L93 Difference]: Finished difference Result 4315 states and 5889 transitions. [2024-10-11 03:40:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:08,502 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-11 03:40:08,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:08,506 INFO L225 Difference]: With dead ends: 4315 [2024-10-11 03:40:08,506 INFO L226 Difference]: Without dead ends: 3197 [2024-10-11 03:40:08,507 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-11 03:40:08,508 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 1034 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:08,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 715 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2024-10-11 03:40:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 2807. [2024-10-11 03:40:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2806 states have (on average 1.3296507483962936) internal successors, (3731), 2806 states have internal predecessors, (3731), 0 states have call successors, (0), 0 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-11 03:40:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 3731 transitions. [2024-10-11 03:40:08,534 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 3731 transitions. Word has length 67 [2024-10-11 03:40:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:08,534 INFO L471 AbstractCegarLoop]: Abstraction has 2807 states and 3731 transitions. [2024-10-11 03:40:08,534 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-11 03:40:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 3731 transitions. [2024-10-11 03:40:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:40:08,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:08,537 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-11 03:40:08,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:40:08,537 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 03:40:08,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash -510700073, now seen corresponding path program 1 times [2024-10-11 03:40:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:08,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477090134] [2024-10-11 03:40:08,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:08,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:08,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477090134] [2024-10-11 03:40:08,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477090134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:08,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:08,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:40:08,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697026550] [2024-10-11 03:40:08,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:08,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:08,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:08,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:08,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:08,612 INFO L87 Difference]: Start difference. First operand 2807 states and 3731 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-11 03:40:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:08,674 INFO L93 Difference]: Finished difference Result 2813 states and 3734 transitions. [2024-10-11 03:40:08,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:08,675 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-11 03:40:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:08,678 INFO L225 Difference]: With dead ends: 2813 [2024-10-11 03:40:08,678 INFO L226 Difference]: Without dead ends: 2342 [2024-10-11 03:40:08,679 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-11 03:40:08,680 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 592 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:08,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 753 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:40:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2024-10-11 03:40:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2338. [2024-10-11 03:40:08,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2338 states, 2337 states have (on average 1.3337612323491657) internal successors, (3117), 2337 states have internal predecessors, (3117), 0 states have call successors, (0), 0 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-11 03:40:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3117 transitions. [2024-10-11 03:40:08,705 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3117 transitions. Word has length 68 [2024-10-11 03:40:08,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:08,705 INFO L471 AbstractCegarLoop]: Abstraction has 2338 states and 3117 transitions. [2024-10-11 03:40:08,705 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-11 03:40:08,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3117 transitions. [2024-10-11 03:40:08,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:40:08,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:08,708 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-11 03:40:08,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:40:08,709 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-11 03:40:08,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash 936875869, now seen corresponding path program 1 times [2024-10-11 03:40:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:08,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643409877] [2024-10-11 03:40:08,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:08,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:08,796 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-11 03:40:08,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:08,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643409877] [2024-10-11 03:40:08,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643409877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:08,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:08,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:08,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489488399] [2024-10-11 03:40:08,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:08,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:08,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:08,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:08,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:08,799 INFO L87 Difference]: Start difference. First operand 2338 states and 3117 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-11 03:40:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:08,833 INFO L93 Difference]: Finished difference Result 5458 states and 7389 transitions. [2024-10-11 03:40:08,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:08,833 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-11 03:40:08,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:08,839 INFO L225 Difference]: With dead ends: 5458 [2024-10-11 03:40:08,839 INFO L226 Difference]: Without dead ends: 3710 [2024-10-11 03:40:08,842 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-11 03:40:08,842 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 134 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 569 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-11 03:40:08,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 569 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:08,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2024-10-11 03:40:08,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3500. [2024-10-11 03:40:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3500 states, 3499 states have (on average 1.330951700485853) internal successors, (4657), 3499 states have internal predecessors, (4657), 0 states have call successors, (0), 0 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-11 03:40:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 4657 transitions. [2024-10-11 03:40:08,926 INFO L78 Accepts]: Start accepts. Automaton has 3500 states and 4657 transitions. Word has length 69 [2024-10-11 03:40:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:08,926 INFO L471 AbstractCegarLoop]: Abstraction has 3500 states and 4657 transitions. [2024-10-11 03:40:08,926 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-11 03:40:08,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 4657 transitions. [2024-10-11 03:40:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 03:40:08,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:08,929 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-11 03:40:08,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:40:08,929 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-11 03:40:08,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:08,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1521240512, now seen corresponding path program 1 times [2024-10-11 03:40:08,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:08,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141275223] [2024-10-11 03:40:08,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:08,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:09,021 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-11 03:40:09,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:09,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141275223] [2024-10-11 03:40:09,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141275223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:09,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:09,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:09,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720644083] [2024-10-11 03:40:09,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:09,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:09,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:09,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:09,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:09,023 INFO L87 Difference]: Start difference. First operand 3500 states and 4657 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-11 03:40:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:09,062 INFO L93 Difference]: Finished difference Result 8992 states and 12135 transitions. [2024-10-11 03:40:09,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:09,062 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-11 03:40:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:09,069 INFO L225 Difference]: With dead ends: 8992 [2024-10-11 03:40:09,070 INFO L226 Difference]: Without dead ends: 6106 [2024-10-11 03:40:09,073 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-11 03:40:09,074 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 122 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:09,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 557 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:09,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6106 states. [2024-10-11 03:40:09,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6106 to 5608. [2024-10-11 03:40:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5608 states, 5607 states have (on average 1.3327982878544675) internal successors, (7473), 5607 states have internal predecessors, (7473), 0 states have call successors, (0), 0 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-11 03:40:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5608 states to 5608 states and 7473 transitions. [2024-10-11 03:40:09,188 INFO L78 Accepts]: Start accepts. Automaton has 5608 states and 7473 transitions. Word has length 70 [2024-10-11 03:40:09,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:09,189 INFO L471 AbstractCegarLoop]: Abstraction has 5608 states and 7473 transitions. [2024-10-11 03:40:09,189 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-11 03:40:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5608 states and 7473 transitions. [2024-10-11 03:40:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 03:40:09,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:09,194 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-11 03:40:09,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:40:09,194 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-11 03:40:09,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:09,194 INFO L85 PathProgramCache]: Analyzing trace with hash -665898309, now seen corresponding path program 1 times [2024-10-11 03:40:09,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:09,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129506551] [2024-10-11 03:40:09,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:09,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:09,344 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-11 03:40:09,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:09,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129506551] [2024-10-11 03:40:09,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129506551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:09,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:09,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:09,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140872033] [2024-10-11 03:40:09,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:09,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:09,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:09,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:09,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:09,345 INFO L87 Difference]: Start difference. First operand 5608 states and 7473 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-11 03:40:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:09,474 INFO L93 Difference]: Finished difference Result 15036 states and 20155 transitions. [2024-10-11 03:40:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:09,475 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-11 03:40:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:09,502 INFO L225 Difference]: With dead ends: 15036 [2024-10-11 03:40:09,505 INFO L226 Difference]: Without dead ends: 10042 [2024-10-11 03:40:09,516 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-11 03:40:09,520 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 100 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:09,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 547 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:40:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10042 states. [2024-10-11 03:40:09,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10042 to 9208. [2024-10-11 03:40:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9208 states, 9207 states have (on average 1.3260562615401326) internal successors, (12209), 9207 states have internal predecessors, (12209), 0 states have call successors, (0), 0 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-11 03:40:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9208 states to 9208 states and 12209 transitions. [2024-10-11 03:40:09,625 INFO L78 Accepts]: Start accepts. Automaton has 9208 states and 12209 transitions. Word has length 72 [2024-10-11 03:40:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:09,625 INFO L471 AbstractCegarLoop]: Abstraction has 9208 states and 12209 transitions. [2024-10-11 03:40:09,625 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-11 03:40:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 9208 states and 12209 transitions. [2024-10-11 03:40:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:40:09,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:09,627 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-11 03:40:09,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:40:09,627 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-11 03:40:09,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:09,628 INFO L85 PathProgramCache]: Analyzing trace with hash 93568553, now seen corresponding path program 1 times [2024-10-11 03:40:09,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:09,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657799822] [2024-10-11 03:40:09,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:09,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:09,871 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-11 03:40:09,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:09,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657799822] [2024-10-11 03:40:09,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657799822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:09,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:09,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:40:09,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830058173] [2024-10-11 03:40:09,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:09,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:40:09,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:09,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:40:09,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:40:09,873 INFO L87 Difference]: Start difference. First operand 9208 states and 12209 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 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-11 03:40:10,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:10,504 INFO L93 Difference]: Finished difference Result 17967 states and 23822 transitions. [2024-10-11 03:40:10,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:40:10,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 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-11 03:40:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:10,541 INFO L225 Difference]: With dead ends: 17967 [2024-10-11 03:40:10,541 INFO L226 Difference]: Without dead ends: 13681 [2024-10-11 03:40:10,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:40:10,560 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 745 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:10,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 742 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:40:10,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13681 states. [2024-10-11 03:40:10,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13681 to 9142. [2024-10-11 03:40:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9142 states, 9141 states have (on average 1.3270976917186303) internal successors, (12131), 9141 states have internal predecessors, (12131), 0 states have call successors, (0), 0 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-11 03:40:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9142 states to 9142 states and 12131 transitions. [2024-10-11 03:40:10,672 INFO L78 Accepts]: Start accepts. Automaton has 9142 states and 12131 transitions. Word has length 74 [2024-10-11 03:40:10,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:10,672 INFO L471 AbstractCegarLoop]: Abstraction has 9142 states and 12131 transitions. [2024-10-11 03:40:10,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 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-11 03:40:10,672 INFO L276 IsEmpty]: Start isEmpty. Operand 9142 states and 12131 transitions. [2024-10-11 03:40:10,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:40:10,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:10,674 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-11 03:40:10,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:40:10,674 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-11 03:40:10,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash 647705213, now seen corresponding path program 1 times [2024-10-11 03:40:10,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:10,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321993289] [2024-10-11 03:40:10,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:10,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:10,855 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-11 03:40:10,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:10,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321993289] [2024-10-11 03:40:10,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321993289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:10,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:10,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:40:10,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686676580] [2024-10-11 03:40:10,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:10,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:40:10,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:10,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:40:10,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:40:10,857 INFO L87 Difference]: Start difference. First operand 9142 states and 12131 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-11 03:40:10,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:10,910 INFO L93 Difference]: Finished difference Result 10056 states and 13348 transitions. [2024-10-11 03:40:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:40:10,911 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-11 03:40:10,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:10,923 INFO L225 Difference]: With dead ends: 10056 [2024-10-11 03:40:10,923 INFO L226 Difference]: Without dead ends: 10054 [2024-10-11 03:40:10,925 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-11 03:40:10,926 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:10,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1351 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:10,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10054 states. [2024-10-11 03:40:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10054 to 10054. [2024-10-11 03:40:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10054 states, 10053 states have (on average 1.2974236546304585) internal successors, (13043), 10053 states have internal predecessors, (13043), 0 states have call successors, (0), 0 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-11 03:40:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10054 states to 10054 states and 13043 transitions. [2024-10-11 03:40:11,080 INFO L78 Accepts]: Start accepts. Automaton has 10054 states and 13043 transitions. Word has length 74 [2024-10-11 03:40:11,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:11,080 INFO L471 AbstractCegarLoop]: Abstraction has 10054 states and 13043 transitions. [2024-10-11 03:40:11,080 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-11 03:40:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 10054 states and 13043 transitions. [2024-10-11 03:40:11,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 03:40:11,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:11,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:11,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:40:11,082 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-11 03:40:11,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:11,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1177815901, now seen corresponding path program 1 times [2024-10-11 03:40:11,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:11,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161930495] [2024-10-11 03:40:11,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:11,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:11,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-11 03:40:11,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:11,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161930495] [2024-10-11 03:40:11,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161930495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:11,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:11,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:11,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396445036] [2024-10-11 03:40:11,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:11,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:11,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:11,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:11,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:11,126 INFO L87 Difference]: Start difference. First operand 10054 states and 13043 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-11 03:40:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:11,183 INFO L93 Difference]: Finished difference Result 24374 states and 31601 transitions. [2024-10-11 03:40:11,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:11,183 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-11 03:40:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:11,203 INFO L225 Difference]: With dead ends: 24374 [2024-10-11 03:40:11,203 INFO L226 Difference]: Without dead ends: 14868 [2024-10-11 03:40:11,213 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-11 03:40:11,214 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 195 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:11,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 425 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14868 states. [2024-10-11 03:40:11,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14868 to 14866. [2024-10-11 03:40:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14866 states, 14865 states have (on average 1.2802556340396904) internal successors, (19031), 14865 states have internal predecessors, (19031), 0 states have call successors, (0), 0 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-11 03:40:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 19031 transitions. [2024-10-11 03:40:11,345 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 19031 transitions. Word has length 75 [2024-10-11 03:40:11,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:11,345 INFO L471 AbstractCegarLoop]: Abstraction has 14866 states and 19031 transitions. [2024-10-11 03:40:11,345 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-11 03:40:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 19031 transitions. [2024-10-11 03:40:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:40:11,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:11,347 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-11 03:40:11,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:40:11,347 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-11 03:40:11,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:11,348 INFO L85 PathProgramCache]: Analyzing trace with hash 667979649, now seen corresponding path program 1 times [2024-10-11 03:40:11,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:11,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371176992] [2024-10-11 03:40:11,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:11,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:11,423 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-11 03:40:11,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:11,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371176992] [2024-10-11 03:40:11,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371176992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:11,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:11,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:40:11,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145222172] [2024-10-11 03:40:11,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:11,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:11,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:11,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:11,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:11,426 INFO L87 Difference]: Start difference. First operand 14866 states and 19031 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-11 03:40:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:11,506 INFO L93 Difference]: Finished difference Result 21658 states and 27886 transitions. [2024-10-11 03:40:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:11,507 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-11 03:40:11,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:11,530 INFO L225 Difference]: With dead ends: 21658 [2024-10-11 03:40:11,531 INFO L226 Difference]: Without dead ends: 18038 [2024-10-11 03:40:11,539 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-11 03:40:11,539 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 660 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:11,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 806 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:11,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18038 states. [2024-10-11 03:40:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18038 to 16814. [2024-10-11 03:40:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16814 states, 16813 states have (on average 1.2765122226848271) internal successors, (21462), 16813 states have internal predecessors, (21462), 0 states have call successors, (0), 0 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-11 03:40:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16814 states to 16814 states and 21462 transitions. [2024-10-11 03:40:11,803 INFO L78 Accepts]: Start accepts. Automaton has 16814 states and 21462 transitions. Word has length 76 [2024-10-11 03:40:11,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:11,803 INFO L471 AbstractCegarLoop]: Abstraction has 16814 states and 21462 transitions. [2024-10-11 03:40:11,803 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-11 03:40:11,803 INFO L276 IsEmpty]: Start isEmpty. Operand 16814 states and 21462 transitions. [2024-10-11 03:40:11,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:40:11,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:11,805 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-11 03:40:11,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 03:40:11,806 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-11 03:40:11,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:11,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1316845845, now seen corresponding path program 1 times [2024-10-11 03:40:11,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:11,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394766967] [2024-10-11 03:40:11,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:11,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:11,882 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-11 03:40:11,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:11,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394766967] [2024-10-11 03:40:11,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394766967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:11,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:11,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:40:11,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65143658] [2024-10-11 03:40:11,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:11,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:11,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:11,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:11,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:11,884 INFO L87 Difference]: Start difference. First operand 16814 states and 21462 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-11 03:40:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:11,976 INFO L93 Difference]: Finished difference Result 22702 states and 29126 transitions. [2024-10-11 03:40:11,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:11,977 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-11 03:40:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:12,005 INFO L225 Difference]: With dead ends: 22702 [2024-10-11 03:40:12,005 INFO L226 Difference]: Without dead ends: 19154 [2024-10-11 03:40:12,015 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-11 03:40:12,015 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 663 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 809 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-11 03:40:12,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 809 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19154 states. [2024-10-11 03:40:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19154 to 18728. [2024-10-11 03:40:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18728 states, 18727 states have (on average 1.2733486409996262) internal successors, (23846), 18727 states have internal predecessors, (23846), 0 states have call successors, (0), 0 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-11 03:40:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18728 states to 18728 states and 23846 transitions. [2024-10-11 03:40:12,210 INFO L78 Accepts]: Start accepts. Automaton has 18728 states and 23846 transitions. Word has length 78 [2024-10-11 03:40:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:12,210 INFO L471 AbstractCegarLoop]: Abstraction has 18728 states and 23846 transitions. [2024-10-11 03:40:12,210 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-11 03:40:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 18728 states and 23846 transitions. [2024-10-11 03:40:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:40:12,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:12,217 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-11 03:40:12,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:40:12,217 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-11 03:40:12,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash -212725949, now seen corresponding path program 1 times [2024-10-11 03:40:12,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:12,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323997692] [2024-10-11 03:40:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:12,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:12,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:12,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323997692] [2024-10-11 03:40:12,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323997692] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:40:12,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533820892] [2024-10-11 03:40:12,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:12,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:12,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:40:12,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:40:12,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:40:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:12,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 03:40:12,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:40:13,330 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-11 03:40:13,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:40:14,137 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-11 03:40:14,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533820892] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:40:14,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:40:14,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 24 [2024-10-11 03:40:14,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135316516] [2024-10-11 03:40:14,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:40:14,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 03:40:14,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:14,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 03:40:14,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2024-10-11 03:40:14,139 INFO L87 Difference]: Start difference. First operand 18728 states and 23846 transitions. Second operand has 24 states, 24 states have (on average 10.75) internal successors, (258), 24 states have internal predecessors, (258), 0 states have call successors, (0), 0 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-11 03:40:24,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:24,917 INFO L93 Difference]: Finished difference Result 174019 states and 222318 transitions. [2024-10-11 03:40:24,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2024-10-11 03:40:24,918 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.75) internal successors, (258), 24 states have internal predecessors, (258), 0 states have call successors, (0), 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-11 03:40:24,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:25,172 INFO L225 Difference]: With dead ends: 174019 [2024-10-11 03:40:25,172 INFO L226 Difference]: Without dead ends: 155849 [2024-10-11 03:40:25,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23521 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=6970, Invalid=47552, Unknown=0, NotChecked=0, Total=54522 [2024-10-11 03:40:25,241 INFO L432 NwaCegarLoop]: 468 mSDtfsCounter, 11523 mSDsluCounter, 4417 mSDsCounter, 0 mSdLazyCounter, 5336 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11523 SdHoareTripleChecker+Valid, 4885 SdHoareTripleChecker+Invalid, 5489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 5336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:25,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11523 Valid, 4885 Invalid, 5489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 5336 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 03:40:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155849 states. [2024-10-11 03:40:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155849 to 118779. [2024-10-11 03:40:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118779 states, 118778 states have (on average 1.2725925676472074) internal successors, (151156), 118778 states have internal predecessors, (151156), 0 states have call successors, (0), 0 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-11 03:40:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118779 states to 118779 states and 151156 transitions. [2024-10-11 03:40:27,623 INFO L78 Accepts]: Start accepts. Automaton has 118779 states and 151156 transitions. Word has length 94 [2024-10-11 03:40:27,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:27,623 INFO L471 AbstractCegarLoop]: Abstraction has 118779 states and 151156 transitions. [2024-10-11 03:40:27,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.75) internal successors, (258), 24 states have internal predecessors, (258), 0 states have call successors, (0), 0 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-11 03:40:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 118779 states and 151156 transitions. [2024-10-11 03:40:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:40:27,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:27,804 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] [2024-10-11 03:40:27,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:40:28,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:28,006 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-11 03:40:28,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:28,007 INFO L85 PathProgramCache]: Analyzing trace with hash -485527328, now seen corresponding path program 1 times [2024-10-11 03:40:28,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:28,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644551531] [2024-10-11 03:40:28,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:28,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:28,097 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-11 03:40:28,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:28,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644551531] [2024-10-11 03:40:28,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644551531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:28,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:28,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:40:28,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946706436] [2024-10-11 03:40:28,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:28,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:28,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:28,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:28,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:28,100 INFO L87 Difference]: Start difference. First operand 118779 states and 151156 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-11 03:40:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:29,097 INFO L93 Difference]: Finished difference Result 241431 states and 306644 transitions. [2024-10-11 03:40:29,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:40:29,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:40:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:29,329 INFO L225 Difference]: With dead ends: 241431 [2024-10-11 03:40:29,329 INFO L226 Difference]: Without dead ends: 123278 [2024-10-11 03:40:29,615 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-11 03:40:29,616 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 509 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:29,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 475 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:40:29,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123278 states. [2024-10-11 03:40:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123278 to 115577. [2024-10-11 03:40:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115577 states, 115576 states have (on average 1.2498615629542467) internal successors, (144454), 115576 states have internal predecessors, (144454), 0 states have call successors, (0), 0 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-11 03:40:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115577 states to 115577 states and 144454 transitions. [2024-10-11 03:40:31,424 INFO L78 Accepts]: Start accepts. Automaton has 115577 states and 144454 transitions. Word has length 96 [2024-10-11 03:40:31,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:31,425 INFO L471 AbstractCegarLoop]: Abstraction has 115577 states and 144454 transitions. [2024-10-11 03:40:31,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-11 03:40:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 115577 states and 144454 transitions. [2024-10-11 03:40:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:40:31,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:31,436 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] [2024-10-11 03:40:31,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:40:31,437 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-11 03:40:31,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:31,437 INFO L85 PathProgramCache]: Analyzing trace with hash 567262291, now seen corresponding path program 1 times [2024-10-11 03:40:31,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:31,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344944319] [2024-10-11 03:40:31,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:31,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:31,585 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-11 03:40:31,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:31,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344944319] [2024-10-11 03:40:31,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344944319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:31,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:31,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:40:31,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887919561] [2024-10-11 03:40:31,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:31,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:31,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:31,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:31,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:31,588 INFO L87 Difference]: Start difference. First operand 115577 states and 144454 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-11 03:40:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:32,394 INFO L93 Difference]: Finished difference Result 147032 states and 184595 transitions. [2024-10-11 03:40:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:32,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-10-11 03:40:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:32,611 INFO L225 Difference]: With dead ends: 147032 [2024-10-11 03:40:32,611 INFO L226 Difference]: Without dead ends: 129553 [2024-10-11 03:40:32,658 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-11 03:40:32,659 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 590 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:32,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 867 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129553 states. [2024-10-11 03:40:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129553 to 125982. [2024-10-11 03:40:34,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125982 states, 125981 states have (on average 1.2473150713202785) internal successors, (157138), 125981 states have internal predecessors, (157138), 0 states have call successors, (0), 0 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-11 03:40:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125982 states to 125982 states and 157138 transitions. [2024-10-11 03:40:34,611 INFO L78 Accepts]: Start accepts. Automaton has 125982 states and 157138 transitions. Word has length 100 [2024-10-11 03:40:34,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:34,612 INFO L471 AbstractCegarLoop]: Abstraction has 125982 states and 157138 transitions. [2024-10-11 03:40:34,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-11 03:40:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 125982 states and 157138 transitions. [2024-10-11 03:40:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 03:40:34,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:34,624 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-11 03:40:34,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 03:40:34,624 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-11 03:40:34,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:34,625 INFO L85 PathProgramCache]: Analyzing trace with hash -695828711, now seen corresponding path program 1 times [2024-10-11 03:40:34,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:34,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756400247] [2024-10-11 03:40:34,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:34,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:34,699 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-11 03:40:34,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:34,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756400247] [2024-10-11 03:40:34,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756400247] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:40:34,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930326911] [2024-10-11 03:40:34,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:34,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:34,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:40:34,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:40:34,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:40:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:34,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:40:34,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:40:35,455 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-11 03:40:35,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:40:35,611 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-11 03:40:35,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930326911] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:40:35,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:40:35,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-10-11 03:40:35,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614317531] [2024-10-11 03:40:35,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:40:35,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 03:40:35,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:35,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 03:40:35,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:40:35,614 INFO L87 Difference]: Start difference. First operand 125982 states and 157138 transitions. Second operand has 14 states, 14 states have (on average 19.357142857142858) internal successors, (271), 14 states have internal predecessors, (271), 0 states have call successors, (0), 0 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-11 03:40:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:36,474 INFO L93 Difference]: Finished difference Result 261000 states and 324880 transitions. [2024-10-11 03:40:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:40:36,474 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.357142857142858) internal successors, (271), 14 states have internal predecessors, (271), 0 states have call successors, (0), 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-11 03:40:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:37,028 INFO L225 Difference]: With dead ends: 261000 [2024-10-11 03:40:37,028 INFO L226 Difference]: Without dead ends: 135552 [2024-10-11 03:40:37,110 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-11 03:40:37,110 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 1628 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:37,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 873 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:40:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135552 states. [2024-10-11 03:40:38,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135552 to 125221. [2024-10-11 03:40:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125221 states, 125220 states have (on average 1.2200367353457915) internal successors, (152773), 125220 states have internal predecessors, (152773), 0 states have call successors, (0), 0 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-11 03:40:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125221 states to 125221 states and 152773 transitions. [2024-10-11 03:40:38,731 INFO L78 Accepts]: Start accepts. Automaton has 125221 states and 152773 transitions. Word has length 102 [2024-10-11 03:40:38,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:38,735 INFO L471 AbstractCegarLoop]: Abstraction has 125221 states and 152773 transitions. [2024-10-11 03:40:38,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.357142857142858) internal successors, (271), 14 states have internal predecessors, (271), 0 states have call successors, (0), 0 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-11 03:40:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 125221 states and 152773 transitions. [2024-10-11 03:40:38,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 03:40:38,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:38,756 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-11 03:40:38,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:40:38,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:38,959 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-11 03:40:38,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:38,960 INFO L85 PathProgramCache]: Analyzing trace with hash -838084400, now seen corresponding path program 1 times [2024-10-11 03:40:38,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:38,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461767021] [2024-10-11 03:40:38,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:38,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:39,076 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-11 03:40:39,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:39,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461767021] [2024-10-11 03:40:39,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461767021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:39,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:39,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:40:39,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104179569] [2024-10-11 03:40:39,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:39,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:40:39,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:39,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:40:39,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:40:39,079 INFO L87 Difference]: Start difference. First operand 125221 states and 152773 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 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-11 03:40:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:40,320 INFO L93 Difference]: Finished difference Result 184828 states and 224082 transitions. [2024-10-11 03:40:40,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:40:40,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 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-11 03:40:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:40,556 INFO L225 Difference]: With dead ends: 184828 [2024-10-11 03:40:40,556 INFO L226 Difference]: Without dead ends: 163606 [2024-10-11 03:40:40,613 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-11 03:40:40,614 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1219 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:40,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 501 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:40:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163606 states. [2024-10-11 03:40:42,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163606 to 125260. [2024-10-11 03:40:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125260 states, 125259 states have (on average 1.2200081431274399) internal successors, (152817), 125259 states have internal predecessors, (152817), 0 states have call successors, (0), 0 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-11 03:40:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125260 states to 125260 states and 152817 transitions. [2024-10-11 03:40:42,746 INFO L78 Accepts]: Start accepts. Automaton has 125260 states and 152817 transitions. Word has length 104 [2024-10-11 03:40:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:42,746 INFO L471 AbstractCegarLoop]: Abstraction has 125260 states and 152817 transitions. [2024-10-11 03:40:42,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 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-11 03:40:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 125260 states and 152817 transitions. [2024-10-11 03:40:42,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:40:42,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:42,760 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] [2024-10-11 03:40:42,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 03:40:42,760 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-11 03:40:42,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:42,761 INFO L85 PathProgramCache]: Analyzing trace with hash 664588901, now seen corresponding path program 1 times [2024-10-11 03:40:42,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:42,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625104502] [2024-10-11 03:40:42,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:42,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:42,861 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-11 03:40:42,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:42,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625104502] [2024-10-11 03:40:42,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625104502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:42,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:42,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:40:42,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827221412] [2024-10-11 03:40:42,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:42,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:40:42,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:42,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:40:42,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:40:42,863 INFO L87 Difference]: Start difference. First operand 125260 states and 152817 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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-11 03:40:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:43,872 INFO L93 Difference]: Finished difference Result 269202 states and 325966 transitions. [2024-10-11 03:40:43,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:43,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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 105 [2024-10-11 03:40:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:44,193 INFO L225 Difference]: With dead ends: 269202 [2024-10-11 03:40:44,194 INFO L226 Difference]: Without dead ends: 210171 [2024-10-11 03:40:44,296 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-11 03:40:44,297 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 153 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:44,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 680 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:40:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210171 states. [2024-10-11 03:40:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210171 to 154984. [2024-10-11 03:40:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154984 states, 154983 states have (on average 1.2202306059374255) internal successors, (189115), 154983 states have internal predecessors, (189115), 0 states have call successors, (0), 0 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-11 03:40:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154984 states to 154984 states and 189115 transitions. [2024-10-11 03:40:46,999 INFO L78 Accepts]: Start accepts. Automaton has 154984 states and 189115 transitions. Word has length 105 [2024-10-11 03:40:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:47,001 INFO L471 AbstractCegarLoop]: Abstraction has 154984 states and 189115 transitions. [2024-10-11 03:40:47,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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-11 03:40:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 154984 states and 189115 transitions. [2024-10-11 03:40:47,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:40:47,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:47,012 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] [2024-10-11 03:40:47,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 03:40:47,013 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-11 03:40:47,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1909047520, now seen corresponding path program 1 times [2024-10-11 03:40:47,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:47,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303405033] [2024-10-11 03:40:47,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:47,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:47,554 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-11 03:40:47,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:47,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303405033] [2024-10-11 03:40:47,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303405033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:47,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:47,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:47,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795303485] [2024-10-11 03:40:47,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:47,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:47,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:47,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:47,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:47,555 INFO L87 Difference]: Start difference. First operand 154984 states and 189115 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-11 03:40:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:48,337 INFO L93 Difference]: Finished difference Result 321916 states and 392322 transitions. [2024-10-11 03:40:48,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:48,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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-11 03:40:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:48,686 INFO L225 Difference]: With dead ends: 321916 [2024-10-11 03:40:48,687 INFO L226 Difference]: Without dead ends: 233161 [2024-10-11 03:40:48,808 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-11 03:40:48,809 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 89 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:48,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 593 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:40:48,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233161 states. [2024-10-11 03:40:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233161 to 166782. [2024-10-11 03:40:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166782 states, 166781 states have (on average 1.2110911914426703) internal successors, (201987), 166781 states have internal predecessors, (201987), 0 states have call successors, (0), 0 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-11 03:40:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166782 states to 166782 states and 201987 transitions. [2024-10-11 03:40:52,115 INFO L78 Accepts]: Start accepts. Automaton has 166782 states and 201987 transitions. Word has length 105 [2024-10-11 03:40:52,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:52,115 INFO L471 AbstractCegarLoop]: Abstraction has 166782 states and 201987 transitions. [2024-10-11 03:40:52,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-11 03:40:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 166782 states and 201987 transitions. [2024-10-11 03:40:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:40:52,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:52,127 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-11 03:40:52,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 03:40:52,128 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-11 03:40:52,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:52,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1648309638, now seen corresponding path program 1 times [2024-10-11 03:40:52,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:52,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100503228] [2024-10-11 03:40:52,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:52,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:53,024 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-11 03:40:53,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:53,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100503228] [2024-10-11 03:40:53,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100503228] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:40:53,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117903894] [2024-10-11 03:40:53,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:53,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:53,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:40:53,026 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:40:53,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:40:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:53,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 03:40:53,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:40:53,858 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-11 03:40:53,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:40:54,694 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-11 03:40:54,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117903894] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:40:54,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:40:54,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 26 [2024-10-11 03:40:54,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708468615] [2024-10-11 03:40:54,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:40:54,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 03:40:54,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:54,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 03:40:54,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2024-10-11 03:40:54,698 INFO L87 Difference]: Start difference. First operand 166782 states and 201987 transitions. Second operand has 27 states, 27 states have (on average 9.518518518518519) internal successors, (257), 26 states have internal predecessors, (257), 0 states have call successors, (0), 0 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-11 03:40:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:57,899 INFO L93 Difference]: Finished difference Result 410907 states and 496096 transitions. [2024-10-11 03:40:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 03:40:57,900 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.518518518518519) internal successors, (257), 26 states have internal predecessors, (257), 0 states have call successors, (0), 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-11 03:40:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:58,388 INFO L225 Difference]: With dead ends: 410907 [2024-10-11 03:40:58,388 INFO L226 Difference]: Without dead ends: 325731 [2024-10-11 03:40:58,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=676, Invalid=2186, Unknown=0, NotChecked=0, Total=2862 [2024-10-11 03:40:58,524 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 4062 mSDsluCounter, 2664 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4062 SdHoareTripleChecker+Valid, 2894 SdHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:58,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4062 Valid, 2894 Invalid, 2585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 03:40:58,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325731 states. [2024-10-11 03:41:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325731 to 168117. [2024-10-11 03:41:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168117 states, 168116 states have (on average 1.210800875585905) internal successors, (203555), 168116 states have internal predecessors, (203555), 0 states have call successors, (0), 0 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-11 03:41:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168117 states to 168117 states and 203555 transitions. [2024-10-11 03:41:02,775 INFO L78 Accepts]: Start accepts. Automaton has 168117 states and 203555 transitions. Word has length 105 [2024-10-11 03:41:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:02,775 INFO L471 AbstractCegarLoop]: Abstraction has 168117 states and 203555 transitions. [2024-10-11 03:41:02,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.518518518518519) internal successors, (257), 26 states have internal predecessors, (257), 0 states have call successors, (0), 0 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-11 03:41:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 168117 states and 203555 transitions. [2024-10-11 03:41:02,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:41:02,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:02,789 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-11 03:41:02,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:41:02,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:41:02,990 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-11 03:41:02,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:02,990 INFO L85 PathProgramCache]: Analyzing trace with hash -848047671, now seen corresponding path program 1 times [2024-10-11 03:41:02,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:02,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876974821] [2024-10-11 03:41:02,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:02,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:03,063 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-11 03:41:03,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:03,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876974821] [2024-10-11 03:41:03,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876974821] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:41:03,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283546478] [2024-10-11 03:41:03,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:03,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:41:03,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:41:03,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:41:03,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:41:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:03,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:41:03,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:41:03,508 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-11 03:41:03,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:41:03,640 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-11 03:41:03,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283546478] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:41:03,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:41:03,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-10-11 03:41:03,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101997080] [2024-10-11 03:41:03,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:41:03,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 03:41:03,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:03,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 03:41:03,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:41:03,643 INFO L87 Difference]: Start difference. First operand 168117 states and 203555 transitions. Second operand has 14 states, 14 states have (on average 20.714285714285715) internal successors, (290), 14 states have internal predecessors, (290), 0 states have call successors, (0), 0 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-11 03:41:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:05,500 INFO L93 Difference]: Finished difference Result 346199 states and 419650 transitions. [2024-10-11 03:41:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:41:05,501 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.714285714285715) internal successors, (290), 14 states have internal predecessors, (290), 0 states have call successors, (0), 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-11 03:41:05,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:05,806 INFO L225 Difference]: With dead ends: 346199 [2024-10-11 03:41:05,806 INFO L226 Difference]: Without dead ends: 179409 [2024-10-11 03:41:05,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 202 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-11 03:41:05,869 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 2081 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2081 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:05,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2081 Valid, 913 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:41:05,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179409 states. [2024-10-11 03:41:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179409 to 154978. [2024-10-11 03:41:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154978 states, 154977 states have (on average 1.1904024468146885) internal successors, (184485), 154977 states have internal predecessors, (184485), 0 states have call successors, (0), 0 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-11 03:41:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154978 states to 154978 states and 184485 transitions. [2024-10-11 03:41:08,164 INFO L78 Accepts]: Start accepts. Automaton has 154978 states and 184485 transitions. Word has length 105 [2024-10-11 03:41:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:08,164 INFO L471 AbstractCegarLoop]: Abstraction has 154978 states and 184485 transitions. [2024-10-11 03:41:08,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.714285714285715) internal successors, (290), 14 states have internal predecessors, (290), 0 states have call successors, (0), 0 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-11 03:41:08,165 INFO L276 IsEmpty]: Start isEmpty. Operand 154978 states and 184485 transitions. [2024-10-11 03:41:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:41:08,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:08,178 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-11 03:41:08,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 03:41:08,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-10-11 03:41:08,380 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-11 03:41:08,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1307773815, now seen corresponding path program 1 times [2024-10-11 03:41:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:08,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533188737] [2024-10-11 03:41:08,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:08,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:08,436 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-11 03:41:08,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:08,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533188737] [2024-10-11 03:41:08,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533188737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:08,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:08,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:41:08,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473452879] [2024-10-11 03:41:08,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:08,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:41:08,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:08,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:41:08,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:41:08,438 INFO L87 Difference]: Start difference. First operand 154978 states and 184485 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)