./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.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 62ddbd8e479b9a9ff0259307914371bc7c12caf38dd9ff6b9d8872f71f8db1de --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:49:09,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:49:09,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:49:09,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:49:09,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:49:09,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:49:09,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:49:09,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:49:09,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:49:09,124 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:49:09,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:49:09,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:49:09,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:49:09,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:49:09,137 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:49:09,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:49:09,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:49:09,138 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:49:09,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:49:09,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:49:09,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:49:09,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:49:09,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:49:09,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:49:09,140 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:49:09,140 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:49:09,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:49:09,140 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:49:09,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:49:09,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:49:09,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:49:09,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:49:09,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:49:09,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:49:09,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:49:09,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:49:09,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:49:09,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:49:09,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:49:09,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:49:09,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:49:09,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:49:09,144 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 62ddbd8e479b9a9ff0259307914371bc7c12caf38dd9ff6b9d8872f71f8db1de [2024-10-14 03:49:09,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:49:09,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:49:09,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:49:09,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:49:09,389 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:49:09,390 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-14 03:49:10,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:49:10,961 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:49:10,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-14 03:49:10,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b8e9b0f2/057a899b660941689856aaeba236b3a0/FLAGe4816dc0d [2024-10-14 03:49:10,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b8e9b0f2/057a899b660941689856aaeba236b3a0 [2024-10-14 03:49:10,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:49:10,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:49:10,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:49:10,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:49:11,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:49:11,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:49:10" (1/1) ... [2024-10-14 03:49:11,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4463a31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:49:11, skipping insertion in model container [2024-10-14 03:49:11,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:49:10" (1/1) ... [2024-10-14 03:49:11,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:49:11,278 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.UNBOUNDED.pals.c.v+lhb-reducer.c[8125,8138] [2024-10-14 03:49:11,316 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.UNBOUNDED.pals.c.v+lhb-reducer.c[14955,14968] [2024-10-14 03:49:11,325 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.UNBOUNDED.pals.c.v+lhb-reducer.c[17042,17055] [2024-10-14 03:49:11,329 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.UNBOUNDED.pals.c.v+lhb-reducer.c[18066,18079] [2024-10-14 03:49:11,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:49:11,448 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:49:11,512 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.UNBOUNDED.pals.c.v+lhb-reducer.c[8125,8138] [2024-10-14 03:49:11,537 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.UNBOUNDED.pals.c.v+lhb-reducer.c[14955,14968] [2024-10-14 03:49:11,542 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.UNBOUNDED.pals.c.v+lhb-reducer.c[17042,17055] [2024-10-14 03:49:11,544 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.UNBOUNDED.pals.c.v+lhb-reducer.c[18066,18079] [2024-10-14 03:49:11,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:49:11,615 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:49:11,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:49:11 WrapperNode [2024-10-14 03:49:11,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:49:11,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:49:11,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:49:11,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:49:11,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:49:11" (1/1) ... [2024-10-14 03:49:11,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:49:11" (1/1) ... [2024-10-14 03:49:11,739 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2617 [2024-10-14 03:49:11,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:49:11,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:49:11,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:49:11,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:49:11,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:49:11" (1/1) ... [2024-10-14 03:49:11,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:49:11" (1/1) ... [2024-10-14 03:49:11,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:49:11" (1/1) ... [2024-10-14 03:49:11,808 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-14 03:49:11,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:49:11" (1/1) ... [2024-10-14 03:49:11,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:49:11" (1/1) ... [2024-10-14 03:49:11,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:49:11" (1/1) ... [2024-10-14 03:49:11,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:49:11" (1/1) ... [2024-10-14 03:49:11,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:49:11" (1/1) ... [2024-10-14 03:49:11,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:49:11" (1/1) ... [2024-10-14 03:49:11,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:49:11,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:49:11,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:49:11,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:49:11,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:49:11" (1/1) ... [2024-10-14 03:49:11,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:49:11,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:49:11,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:49:11,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:49:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:49:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:49:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:49:11,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:49:12,162 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:49:12,164 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:49:13,431 INFO L? ?]: Removed 426 outVars from TransFormulas that were not future-live. [2024-10-14 03:49:13,431 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:49:13,484 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:49:13,485 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:49:13,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:49:13 BoogieIcfgContainer [2024-10-14 03:49:13,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:49:13,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:49:13,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:49:13,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:49:13,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:49:10" (1/3) ... [2024-10-14 03:49:13,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1ed6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:49:13, skipping insertion in model container [2024-10-14 03:49:13,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:49:11" (2/3) ... [2024-10-14 03:49:13,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1ed6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:49:13, skipping insertion in model container [2024-10-14 03:49:13,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:49:13" (3/3) ... [2024-10-14 03:49:13,494 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-14 03:49:13,507 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:49:13,508 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-14 03:49:13,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:49:13,578 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;@5cd2079e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:49:13,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-14 03:49:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 454 states, 449 states have (on average 1.8530066815144766) internal successors, (832), 453 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:49:13,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:13,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:13,599 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-14 03:49:13,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:13,603 INFO L85 PathProgramCache]: Analyzing trace with hash 34120099, now seen corresponding path program 1 times [2024-10-14 03:49:13,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:13,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015375762] [2024-10-14 03:49:13,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:13,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:13,994 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-14 03:49:13,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:13,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015375762] [2024-10-14 03:49:13,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015375762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:13,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:13,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:49:13,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262352574] [2024-10-14 03:49:13,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:14,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:49:14,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:14,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:49:14,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:49:14,032 INFO L87 Difference]: Start difference. First operand has 454 states, 449 states have (on average 1.8530066815144766) internal successors, (832), 453 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:14,477 INFO L93 Difference]: Finished difference Result 796 states and 1404 transitions. [2024-10-14 03:49:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:49:14,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-14 03:49:14,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:14,488 INFO L225 Difference]: With dead ends: 796 [2024-10-14 03:49:14,489 INFO L226 Difference]: Without dead ends: 505 [2024-10-14 03:49:14,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:49:14,494 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 2411 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2411 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:14,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2411 Valid, 614 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:49:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-10-14 03:49:14,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 499. [2024-10-14 03:49:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 495 states have (on average 1.3636363636363635) internal successors, (675), 498 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 675 transitions. [2024-10-14 03:49:14,551 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 675 transitions. Word has length 49 [2024-10-14 03:49:14,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:14,551 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 675 transitions. [2024-10-14 03:49:14,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:14,552 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 675 transitions. [2024-10-14 03:49:14,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:49:14,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:14,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:14,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:49:14,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 03:49:14,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:14,555 INFO L85 PathProgramCache]: Analyzing trace with hash 758566708, now seen corresponding path program 1 times [2024-10-14 03:49:14,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:14,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376644959] [2024-10-14 03:49:14,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:14,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:49:14,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:14,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376644959] [2024-10-14 03:49:14,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376644959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:14,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:14,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:49:14,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128079838] [2024-10-14 03:49:14,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:14,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:49:14,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:14,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:49:14,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:49:14,633 INFO L87 Difference]: Start difference. First operand 499 states and 675 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:14,666 INFO L93 Difference]: Finished difference Result 817 states and 1148 transitions. [2024-10-14 03:49:14,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:49:14,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-14 03:49:14,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:14,669 INFO L225 Difference]: With dead ends: 817 [2024-10-14 03:49:14,669 INFO L226 Difference]: Without dead ends: 610 [2024-10-14 03:49:14,670 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-14 03:49:14,672 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 323 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:14,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 869 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:14,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-10-14 03:49:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 603. [2024-10-14 03:49:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 599 states have (on average 1.3823038397328882) internal successors, (828), 602 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 828 transitions. [2024-10-14 03:49:14,697 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 828 transitions. Word has length 49 [2024-10-14 03:49:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:14,697 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 828 transitions. [2024-10-14 03:49:14,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 828 transitions. [2024-10-14 03:49:14,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:49:14,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:14,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:14,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:49:14,702 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-14 03:49:14,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:14,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1943064238, now seen corresponding path program 1 times [2024-10-14 03:49:14,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:14,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235402637] [2024-10-14 03:49:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:14,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:14,847 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-14 03:49:14,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:14,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235402637] [2024-10-14 03:49:14,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235402637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:14,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:14,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:49:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639546171] [2024-10-14 03:49:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:14,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:49:14,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:14,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:49:14,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:49:14,849 INFO L87 Difference]: Start difference. First operand 603 states and 828 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:14,904 INFO L93 Difference]: Finished difference Result 1204 states and 1718 transitions. [2024-10-14 03:49:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:49:14,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-14 03:49:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:14,908 INFO L225 Difference]: With dead ends: 1204 [2024-10-14 03:49:14,908 INFO L226 Difference]: Without dead ends: 899 [2024-10-14 03:49:14,912 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-14 03:49:14,913 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 279 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:14,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 902 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2024-10-14 03:49:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 892. [2024-10-14 03:49:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 888 states have (on average 1.4065315315315314) internal successors, (1249), 891 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1249 transitions. [2024-10-14 03:49:14,934 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1249 transitions. Word has length 49 [2024-10-14 03:49:14,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:14,934 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1249 transitions. [2024-10-14 03:49:14,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:14,934 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1249 transitions. [2024-10-14 03:49:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:49:14,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:14,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:14,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:49:14,937 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-14 03:49:14,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1798780356, now seen corresponding path program 1 times [2024-10-14 03:49:14,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:14,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335417072] [2024-10-14 03:49:14,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:14,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:49:15,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:15,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335417072] [2024-10-14 03:49:15,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335417072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:15,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:15,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:49:15,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589754637] [2024-10-14 03:49:15,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:15,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:49:15,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:15,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:49:15,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:49:15,065 INFO L87 Difference]: Start difference. First operand 892 states and 1249 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:15,316 INFO L93 Difference]: Finished difference Result 2155 states and 3104 transitions. [2024-10-14 03:49:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:49:15,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-14 03:49:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:15,322 INFO L225 Difference]: With dead ends: 2155 [2024-10-14 03:49:15,322 INFO L226 Difference]: Without dead ends: 1358 [2024-10-14 03:49:15,324 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-14 03:49:15,325 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 1590 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:15,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 361 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:49:15,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2024-10-14 03:49:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1352. [2024-10-14 03:49:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1348 states have (on average 1.4376854599406528) internal successors, (1938), 1351 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:15,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1938 transitions. [2024-10-14 03:49:15,350 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1938 transitions. Word has length 49 [2024-10-14 03:49:15,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:15,350 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1938 transitions. [2024-10-14 03:49:15,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:15,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1938 transitions. [2024-10-14 03:49:15,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 03:49:15,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:15,352 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-14 03:49:15,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:49:15,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 03:49:15,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:15,353 INFO L85 PathProgramCache]: Analyzing trace with hash -108782984, now seen corresponding path program 1 times [2024-10-14 03:49:15,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:15,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929450777] [2024-10-14 03:49:15,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:15,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:15,419 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-14 03:49:15,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:15,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929450777] [2024-10-14 03:49:15,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929450777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:15,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:15,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:49:15,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177898914] [2024-10-14 03:49:15,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:15,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:49:15,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:15,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:49:15,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:49:15,421 INFO L87 Difference]: Start difference. First operand 1352 states and 1938 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-14 03:49:15,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:15,456 INFO L93 Difference]: Finished difference Result 2762 states and 3975 transitions. [2024-10-14 03:49:15,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:49:15,457 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-14 03:49:15,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:15,461 INFO L225 Difference]: With dead ends: 2762 [2024-10-14 03:49:15,461 INFO L226 Difference]: Without dead ends: 1771 [2024-10-14 03:49:15,463 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-14 03:49:15,463 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 313 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 824 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-14 03:49:15,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 824 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:15,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2024-10-14 03:49:15,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1753. [2024-10-14 03:49:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1749 states have (on average 1.3985134362492853) internal successors, (2446), 1752 states have internal predecessors, (2446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2446 transitions. [2024-10-14 03:49:15,522 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2446 transitions. Word has length 50 [2024-10-14 03:49:15,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:15,522 INFO L471 AbstractCegarLoop]: Abstraction has 1753 states and 2446 transitions. [2024-10-14 03:49:15,523 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-14 03:49:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2446 transitions. [2024-10-14 03:49:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 03:49:15,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:15,532 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-14 03:49:15,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:49:15,532 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-14 03:49:15,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1856759737, now seen corresponding path program 1 times [2024-10-14 03:49:15,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:15,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008816023] [2024-10-14 03:49:15,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:15,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:15,785 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-14 03:49:15,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:15,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008816023] [2024-10-14 03:49:15,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008816023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:15,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:15,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:49:15,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459877206] [2024-10-14 03:49:15,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:15,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:49:15,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:15,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:49:15,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:49:15,787 INFO L87 Difference]: Start difference. First operand 1753 states and 2446 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-14 03:49:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:16,587 INFO L93 Difference]: Finished difference Result 3898 states and 5481 transitions. [2024-10-14 03:49:16,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:49:16,587 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-14 03:49:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:16,597 INFO L225 Difference]: With dead ends: 3898 [2024-10-14 03:49:16,598 INFO L226 Difference]: Without dead ends: 2315 [2024-10-14 03:49:16,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:49:16,610 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 1382 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:16,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 338 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:49:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2024-10-14 03:49:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2299. [2024-10-14 03:49:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2299 states, 2295 states have (on average 1.3938997821350763) internal successors, (3199), 2298 states have internal predecessors, (3199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 3199 transitions. [2024-10-14 03:49:16,708 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 3199 transitions. Word has length 51 [2024-10-14 03:49:16,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:16,709 INFO L471 AbstractCegarLoop]: Abstraction has 2299 states and 3199 transitions. [2024-10-14 03:49:16,709 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-14 03:49:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 3199 transitions. [2024-10-14 03:49:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:49:16,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:16,711 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-14 03:49:16,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:49:16,713 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-14 03:49:16,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:16,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1124331061, now seen corresponding path program 1 times [2024-10-14 03:49:16,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:16,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902102306] [2024-10-14 03:49:16,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:16,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:17,067 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-14 03:49:17,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:17,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902102306] [2024-10-14 03:49:17,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902102306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:17,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:17,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:49:17,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114700616] [2024-10-14 03:49:17,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:17,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:49:17,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:17,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:49:17,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:49:17,075 INFO L87 Difference]: Start difference. First operand 2299 states and 3199 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:17,736 INFO L93 Difference]: Finished difference Result 4525 states and 6386 transitions. [2024-10-14 03:49:17,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:49:17,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-14 03:49:17,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:17,746 INFO L225 Difference]: With dead ends: 4525 [2024-10-14 03:49:17,746 INFO L226 Difference]: Without dead ends: 3495 [2024-10-14 03:49:17,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:49:17,750 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1712 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:17,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 586 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:49:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2024-10-14 03:49:17,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 2313. [2024-10-14 03:49:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.3932438284971849) internal successors, (3217), 2312 states have internal predecessors, (3217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3217 transitions. [2024-10-14 03:49:17,798 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3217 transitions. Word has length 52 [2024-10-14 03:49:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:17,799 INFO L471 AbstractCegarLoop]: Abstraction has 2313 states and 3217 transitions. [2024-10-14 03:49:17,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3217 transitions. [2024-10-14 03:49:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:49:17,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:17,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:17,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:49:17,801 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-14 03:49:17,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:17,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1221262858, now seen corresponding path program 1 times [2024-10-14 03:49:17,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:17,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514345168] [2024-10-14 03:49:17,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:17,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:17,918 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-14 03:49:17,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:17,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514345168] [2024-10-14 03:49:17,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514345168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:17,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:17,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:49:17,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477633742] [2024-10-14 03:49:17,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:17,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:49:17,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:17,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:49:17,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:49:17,920 INFO L87 Difference]: Start difference. First operand 2313 states and 3217 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:18,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:18,259 INFO L93 Difference]: Finished difference Result 4993 states and 7054 transitions. [2024-10-14 03:49:18,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:49:18,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-14 03:49:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:18,268 INFO L225 Difference]: With dead ends: 4993 [2024-10-14 03:49:18,268 INFO L226 Difference]: Without dead ends: 4150 [2024-10-14 03:49:18,270 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-14 03:49:18,270 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 1837 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1837 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:18,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1837 Valid, 621 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:49:18,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4150 states. [2024-10-14 03:49:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4150 to 2335. [2024-10-14 03:49:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2331 states have (on average 1.3933933933933933) internal successors, (3248), 2334 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3248 transitions. [2024-10-14 03:49:18,310 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3248 transitions. Word has length 52 [2024-10-14 03:49:18,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:18,310 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3248 transitions. [2024-10-14 03:49:18,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3248 transitions. [2024-10-14 03:49:18,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:49:18,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:18,312 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-14 03:49:18,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:49:18,312 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-14 03:49:18,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:18,313 INFO L85 PathProgramCache]: Analyzing trace with hash -163415276, now seen corresponding path program 1 times [2024-10-14 03:49:18,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:18,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121550538] [2024-10-14 03:49:18,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:18,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:18,404 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-14 03:49:18,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:18,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121550538] [2024-10-14 03:49:18,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121550538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:18,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:18,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:49:18,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296690325] [2024-10-14 03:49:18,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:18,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:49:18,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:18,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:49:18,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:49:18,406 INFO L87 Difference]: Start difference. First operand 2335 states and 3248 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:18,736 INFO L93 Difference]: Finished difference Result 5750 states and 8135 transitions. [2024-10-14 03:49:18,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:49:18,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-14 03:49:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:18,747 INFO L225 Difference]: With dead ends: 5750 [2024-10-14 03:49:18,748 INFO L226 Difference]: Without dead ends: 4782 [2024-10-14 03:49:18,749 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-14 03:49:18,750 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 1951 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1951 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:18,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1951 Valid, 633 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:49:18,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2024-10-14 03:49:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 2369. [2024-10-14 03:49:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 2365 states have (on average 1.3919661733615223) internal successors, (3292), 2368 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 3292 transitions. [2024-10-14 03:49:18,794 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 3292 transitions. Word has length 52 [2024-10-14 03:49:18,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:18,794 INFO L471 AbstractCegarLoop]: Abstraction has 2369 states and 3292 transitions. [2024-10-14 03:49:18,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:18,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 3292 transitions. [2024-10-14 03:49:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:49:18,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:18,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:18,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:49:18,796 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-14 03:49:18,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:18,797 INFO L85 PathProgramCache]: Analyzing trace with hash -55106621, now seen corresponding path program 1 times [2024-10-14 03:49:18,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:18,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213122631] [2024-10-14 03:49:18,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:18,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:19,169 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-14 03:49:19,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:19,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213122631] [2024-10-14 03:49:19,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213122631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:19,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:19,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:49:19,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338211684] [2024-10-14 03:49:19,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:19,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:49:19,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:19,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:49:19,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:49:19,170 INFO L87 Difference]: Start difference. First operand 2369 states and 3292 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-14 03:49:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:19,601 INFO L93 Difference]: Finished difference Result 4786 states and 6791 transitions. [2024-10-14 03:49:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:49:19,601 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-14 03:49:19,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:19,609 INFO L225 Difference]: With dead ends: 4786 [2024-10-14 03:49:19,609 INFO L226 Difference]: Without dead ends: 3248 [2024-10-14 03:49:19,613 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-14 03:49:19,613 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 1436 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:19,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 774 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:49:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2024-10-14 03:49:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2279. [2024-10-14 03:49:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 2275 states have (on average 1.3907692307692308) internal successors, (3164), 2278 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-14 03:49:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3164 transitions. [2024-10-14 03:49:19,642 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3164 transitions. Word has length 53 [2024-10-14 03:49:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:19,642 INFO L471 AbstractCegarLoop]: Abstraction has 2279 states and 3164 transitions. [2024-10-14 03:49:19,642 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-14 03:49:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3164 transitions. [2024-10-14 03:49:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:49:19,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:19,644 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-14 03:49:19,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:49:19,644 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-14 03:49:19,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:19,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1129390909, now seen corresponding path program 1 times [2024-10-14 03:49:19,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:19,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499050621] [2024-10-14 03:49:19,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:19,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:19,888 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-14 03:49:19,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:19,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499050621] [2024-10-14 03:49:19,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499050621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:19,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:19,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:49:19,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871402877] [2024-10-14 03:49:19,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:19,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:49:19,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:19,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:49:19,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:49:19,890 INFO L87 Difference]: Start difference. First operand 2279 states and 3164 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:20,401 INFO L93 Difference]: Finished difference Result 4879 states and 6894 transitions. [2024-10-14 03:49:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:49:20,402 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-14 03:49:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:20,410 INFO L225 Difference]: With dead ends: 4879 [2024-10-14 03:49:20,410 INFO L226 Difference]: Without dead ends: 3501 [2024-10-14 03:49:20,416 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-14 03:49:20,416 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 1554 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:20,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 1026 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:49:20,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2024-10-14 03:49:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 2250. [2024-10-14 03:49:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 2246 states have (on average 1.3904719501335707) internal successors, (3123), 2249 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3123 transitions. [2024-10-14 03:49:20,447 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3123 transitions. Word has length 53 [2024-10-14 03:49:20,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:20,447 INFO L471 AbstractCegarLoop]: Abstraction has 2250 states and 3123 transitions. [2024-10-14 03:49:20,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3123 transitions. [2024-10-14 03:49:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:49:20,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:20,449 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-14 03:49:20,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:49:20,449 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-14 03:49:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash -421230622, now seen corresponding path program 1 times [2024-10-14 03:49:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988825163] [2024-10-14 03:49:20,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:20,655 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-14 03:49:20,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:20,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988825163] [2024-10-14 03:49:20,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988825163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:20,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:20,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:49:20,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347116863] [2024-10-14 03:49:20,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:20,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:49:20,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:20,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:49:20,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:49:20,657 INFO L87 Difference]: Start difference. First operand 2250 states and 3123 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:21,135 INFO L93 Difference]: Finished difference Result 3343 states and 4664 transitions. [2024-10-14 03:49:21,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:49:21,135 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-14 03:49:21,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:21,140 INFO L225 Difference]: With dead ends: 3343 [2024-10-14 03:49:21,140 INFO L226 Difference]: Without dead ends: 3338 [2024-10-14 03:49:21,141 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-14 03:49:21,141 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 1508 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:21,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1077 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:49:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2024-10-14 03:49:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2250. [2024-10-14 03:49:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 2246 states have (on average 1.3895814781834372) internal successors, (3121), 2249 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3121 transitions. [2024-10-14 03:49:21,226 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3121 transitions. Word has length 53 [2024-10-14 03:49:21,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:21,226 INFO L471 AbstractCegarLoop]: Abstraction has 2250 states and 3121 transitions. [2024-10-14 03:49:21,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3121 transitions. [2024-10-14 03:49:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 03:49:21,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:21,228 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-14 03:49:21,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:49:21,229 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-14 03:49:21,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:21,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1237294753, now seen corresponding path program 1 times [2024-10-14 03:49:21,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:21,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15257485] [2024-10-14 03:49:21,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:21,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:21,279 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-14 03:49:21,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:21,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15257485] [2024-10-14 03:49:21,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15257485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:21,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:21,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:49:21,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671186206] [2024-10-14 03:49:21,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:21,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:49:21,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:21,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:49:21,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:49:21,281 INFO L87 Difference]: Start difference. First operand 2250 states and 3121 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:21,322 INFO L93 Difference]: Finished difference Result 3192 states and 4470 transitions. [2024-10-14 03:49:21,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:49:21,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-14 03:49:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:21,326 INFO L225 Difference]: With dead ends: 3192 [2024-10-14 03:49:21,326 INFO L226 Difference]: Without dead ends: 2257 [2024-10-14 03:49:21,328 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-14 03:49:21,328 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 224 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 796 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-14 03:49:21,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 796 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:21,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2024-10-14 03:49:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2250. [2024-10-14 03:49:21,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 2246 states have (on average 1.3762243989314336) internal successors, (3091), 2249 states have internal predecessors, (3091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3091 transitions. [2024-10-14 03:49:21,360 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3091 transitions. Word has length 54 [2024-10-14 03:49:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:21,361 INFO L471 AbstractCegarLoop]: Abstraction has 2250 states and 3091 transitions. [2024-10-14 03:49:21,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3091 transitions. [2024-10-14 03:49:21,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 03:49:21,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:21,363 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-14 03:49:21,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:49:21,363 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-14 03:49:21,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:21,364 INFO L85 PathProgramCache]: Analyzing trace with hash -863697757, now seen corresponding path program 1 times [2024-10-14 03:49:21,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:21,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803129808] [2024-10-14 03:49:21,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:21,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:21,418 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-14 03:49:21,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:21,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803129808] [2024-10-14 03:49:21,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803129808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:21,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:21,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:49:21,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012856886] [2024-10-14 03:49:21,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:21,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:49:21,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:21,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:49:21,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:49:21,419 INFO L87 Difference]: Start difference. First operand 2250 states and 3091 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:21,447 INFO L93 Difference]: Finished difference Result 3251 states and 4506 transitions. [2024-10-14 03:49:21,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:49:21,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-14 03:49:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:21,450 INFO L225 Difference]: With dead ends: 3251 [2024-10-14 03:49:21,450 INFO L226 Difference]: Without dead ends: 2256 [2024-10-14 03:49:21,451 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-14 03:49:21,452 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 240 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 797 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-14 03:49:21,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 797 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:21,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2024-10-14 03:49:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2250. [2024-10-14 03:49:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 2246 states have (on average 1.3637577916295636) internal successors, (3063), 2249 states have internal predecessors, (3063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3063 transitions. [2024-10-14 03:49:21,471 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3063 transitions. Word has length 54 [2024-10-14 03:49:21,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:21,471 INFO L471 AbstractCegarLoop]: Abstraction has 2250 states and 3063 transitions. [2024-10-14 03:49:21,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3063 transitions. [2024-10-14 03:49:21,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 03:49:21,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:21,473 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-14 03:49:21,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:49:21,473 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-14 03:49:21,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1589153365, now seen corresponding path program 1 times [2024-10-14 03:49:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:21,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518025376] [2024-10-14 03:49:21,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:21,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:21,510 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-14 03:49:21,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:21,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518025376] [2024-10-14 03:49:21,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518025376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:21,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:21,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:49:21,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603198397] [2024-10-14 03:49:21,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:21,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:49:21,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:21,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:49:21,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:49:21,511 INFO L87 Difference]: Start difference. First operand 2250 states and 3063 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:21,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:21,536 INFO L93 Difference]: Finished difference Result 3331 states and 4569 transitions. [2024-10-14 03:49:21,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:49:21,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-14 03:49:21,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:21,539 INFO L225 Difference]: With dead ends: 3331 [2024-10-14 03:49:21,539 INFO L226 Difference]: Without dead ends: 2241 [2024-10-14 03:49:21,540 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-14 03:49:21,541 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 259 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 812 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-14 03:49:21,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 812 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:21,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2024-10-14 03:49:21,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2235. [2024-10-14 03:49:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2235 states, 2231 states have (on average 1.3442402510085163) internal successors, (2999), 2234 states have internal predecessors, (2999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2999 transitions. [2024-10-14 03:49:21,561 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2999 transitions. Word has length 54 [2024-10-14 03:49:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:21,561 INFO L471 AbstractCegarLoop]: Abstraction has 2235 states and 2999 transitions. [2024-10-14 03:49:21,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2999 transitions. [2024-10-14 03:49:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 03:49:21,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:21,563 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-14 03:49:21,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:49:21,563 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-14 03:49:21,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:21,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1127796312, now seen corresponding path program 1 times [2024-10-14 03:49:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:21,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985237816] [2024-10-14 03:49:21,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:21,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:21,603 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-14 03:49:21,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:21,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985237816] [2024-10-14 03:49:21,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985237816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:21,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:21,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:49:21,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517911688] [2024-10-14 03:49:21,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:21,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:49:21,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:21,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:49:21,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:49:21,605 INFO L87 Difference]: Start difference. First operand 2235 states and 2999 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-14 03:49:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:21,654 INFO L93 Difference]: Finished difference Result 3996 states and 5435 transitions. [2024-10-14 03:49:21,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:49:21,655 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-14 03:49:21,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:21,658 INFO L225 Difference]: With dead ends: 3996 [2024-10-14 03:49:21,658 INFO L226 Difference]: Without dead ends: 2739 [2024-10-14 03:49:21,660 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-14 03:49:21,660 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 348 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 538 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-14 03:49:21,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 538 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:21,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2024-10-14 03:49:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 2053. [2024-10-14 03:49:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2049 states have (on average 1.3484626647144948) internal successors, (2763), 2052 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2763 transitions. [2024-10-14 03:49:21,680 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2763 transitions. Word has length 55 [2024-10-14 03:49:21,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:21,680 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 2763 transitions. [2024-10-14 03:49:21,680 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-14 03:49:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2763 transitions. [2024-10-14 03:49:21,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 03:49:21,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:21,681 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-14 03:49:21,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:49:21,682 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 03:49:21,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:21,682 INFO L85 PathProgramCache]: Analyzing trace with hash 847139516, now seen corresponding path program 1 times [2024-10-14 03:49:21,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:21,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821886138] [2024-10-14 03:49:21,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:21,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:21,716 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-14 03:49:21,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:21,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821886138] [2024-10-14 03:49:21,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821886138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:21,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:21,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:49:21,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385878837] [2024-10-14 03:49:21,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:21,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:49:21,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:21,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:49:21,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:49:21,718 INFO L87 Difference]: Start difference. First operand 2053 states and 2763 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-14 03:49:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:21,776 INFO L93 Difference]: Finished difference Result 3720 states and 5058 transitions. [2024-10-14 03:49:21,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:49:21,777 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-14 03:49:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:21,780 INFO L225 Difference]: With dead ends: 3720 [2024-10-14 03:49:21,780 INFO L226 Difference]: Without dead ends: 2476 [2024-10-14 03:49:21,781 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-14 03:49:21,782 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 300 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:21,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 456 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:21,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2024-10-14 03:49:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 1931. [2024-10-14 03:49:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1927 states have (on average 1.3528801245459263) internal successors, (2607), 1930 states have internal predecessors, (2607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2607 transitions. [2024-10-14 03:49:21,799 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2607 transitions. Word has length 56 [2024-10-14 03:49:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:21,800 INFO L471 AbstractCegarLoop]: Abstraction has 1931 states and 2607 transitions. [2024-10-14 03:49:21,800 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-14 03:49:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2607 transitions. [2024-10-14 03:49:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 03:49:21,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:21,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:21,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:49:21,802 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 03:49:21,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:21,802 INFO L85 PathProgramCache]: Analyzing trace with hash 474120695, now seen corresponding path program 1 times [2024-10-14 03:49:21,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:21,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323794597] [2024-10-14 03:49:21,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:21,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:22,224 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-14 03:49:22,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323794597] [2024-10-14 03:49:22,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323794597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:22,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:22,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:49:22,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470566676] [2024-10-14 03:49:22,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:22,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:49:22,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:22,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:49:22,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:49:22,226 INFO L87 Difference]: Start difference. First operand 1931 states and 2607 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:22,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:22,789 INFO L93 Difference]: Finished difference Result 2786 states and 3799 transitions. [2024-10-14 03:49:22,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:49:22,789 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-14 03:49:22,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:22,793 INFO L225 Difference]: With dead ends: 2786 [2024-10-14 03:49:22,793 INFO L226 Difference]: Without dead ends: 2782 [2024-10-14 03:49:22,793 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-14 03:49:22,794 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1709 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:22,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 2289 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:49:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2024-10-14 03:49:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 1927. [2024-10-14 03:49:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1924 states have (on average 1.3529106029106028) internal successors, (2603), 1926 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2603 transitions. [2024-10-14 03:49:22,812 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2603 transitions. Word has length 56 [2024-10-14 03:49:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:22,812 INFO L471 AbstractCegarLoop]: Abstraction has 1927 states and 2603 transitions. [2024-10-14 03:49:22,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2603 transitions. [2024-10-14 03:49:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 03:49:22,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:22,813 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-14 03:49:22,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:49:22,814 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-14 03:49:22,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:22,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1321631968, now seen corresponding path program 1 times [2024-10-14 03:49:22,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:22,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615933] [2024-10-14 03:49:22,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:49:23,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:23,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615933] [2024-10-14 03:49:23,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:23,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:23,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-14 03:49:23,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146916484] [2024-10-14 03:49:23,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:23,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 03:49:23,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:23,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 03:49:23,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2024-10-14 03:49:23,464 INFO L87 Difference]: Start difference. First operand 1927 states and 2603 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 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-14 03:49:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:25,223 INFO L93 Difference]: Finished difference Result 3356 states and 4564 transitions. [2024-10-14 03:49:25,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 03:49:25,224 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 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-14 03:49:25,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:25,228 INFO L225 Difference]: With dead ends: 3356 [2024-10-14 03:49:25,228 INFO L226 Difference]: Without dead ends: 3350 [2024-10-14 03:49:25,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2024-10-14 03:49:25,230 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 3271 mSDsluCounter, 3202 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3271 SdHoareTripleChecker+Valid, 3511 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:25,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3271 Valid, 3511 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 03:49:25,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2024-10-14 03:49:25,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 1927. [2024-10-14 03:49:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1924 states have (on average 1.3523908523908523) internal successors, (2602), 1926 states have internal predecessors, (2602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2602 transitions. [2024-10-14 03:49:25,248 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2602 transitions. Word has length 56 [2024-10-14 03:49:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:25,248 INFO L471 AbstractCegarLoop]: Abstraction has 1927 states and 2602 transitions. [2024-10-14 03:49:25,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 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-14 03:49:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2602 transitions. [2024-10-14 03:49:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 03:49:25,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:25,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, 1, 1, 1, 1, 1] [2024-10-14 03:49:25,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:49:25,250 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-14 03:49:25,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:25,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1854706179, now seen corresponding path program 1 times [2024-10-14 03:49:25,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:25,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010396625] [2024-10-14 03:49:25,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:25,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:25,657 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-14 03:49:25,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:25,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010396625] [2024-10-14 03:49:25,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010396625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:25,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:25,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:49:25,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979163372] [2024-10-14 03:49:25,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:25,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:49:25,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:25,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:49:25,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:49:25,659 INFO L87 Difference]: Start difference. First operand 1927 states and 2602 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:26,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:26,362 INFO L93 Difference]: Finished difference Result 2735 states and 3719 transitions. [2024-10-14 03:49:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:49:26,363 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-14 03:49:26,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:26,367 INFO L225 Difference]: With dead ends: 2735 [2024-10-14 03:49:26,367 INFO L226 Difference]: Without dead ends: 2674 [2024-10-14 03:49:26,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-14 03:49:26,368 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 2047 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2047 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:26,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2047 Valid, 1964 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:49:26,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2024-10-14 03:49:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 1915. [2024-10-14 03:49:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1915 states, 1913 states have (on average 1.3533716675378986) internal successors, (2589), 1914 states have internal predecessors, (2589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2589 transitions. [2024-10-14 03:49:26,401 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2589 transitions. Word has length 56 [2024-10-14 03:49:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:26,401 INFO L471 AbstractCegarLoop]: Abstraction has 1915 states and 2589 transitions. [2024-10-14 03:49:26,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2589 transitions. [2024-10-14 03:49:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 03:49:26,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:26,403 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-14 03:49:26,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:49:26,403 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 03:49:26,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:26,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1858163223, now seen corresponding path program 1 times [2024-10-14 03:49:26,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:26,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790437261] [2024-10-14 03:49:26,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:26,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:26,956 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-14 03:49:26,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:26,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790437261] [2024-10-14 03:49:26,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790437261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:26,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:26,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:49:26,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599538140] [2024-10-14 03:49:26,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:26,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:49:26,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:26,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:49:26,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:49:26,959 INFO L87 Difference]: Start difference. First operand 1915 states and 2589 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:27,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:27,501 INFO L93 Difference]: Finished difference Result 2770 states and 3781 transitions. [2024-10-14 03:49:27,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:49:27,501 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-14 03:49:27,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:27,505 INFO L225 Difference]: With dead ends: 2770 [2024-10-14 03:49:27,505 INFO L226 Difference]: Without dead ends: 2766 [2024-10-14 03:49:27,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:49:27,506 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 1937 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1937 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:27,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1937 Valid, 1720 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:49:27,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2024-10-14 03:49:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 1915. [2024-10-14 03:49:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1915 states, 1913 states have (on average 1.352848928384736) internal successors, (2588), 1914 states have internal predecessors, (2588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2588 transitions. [2024-10-14 03:49:27,525 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2588 transitions. Word has length 56 [2024-10-14 03:49:27,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:27,525 INFO L471 AbstractCegarLoop]: Abstraction has 1915 states and 2588 transitions. [2024-10-14 03:49:27,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:27,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2588 transitions. [2024-10-14 03:49:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 03:49:27,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:27,527 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-14 03:49:27,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:49:27,527 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 03:49:27,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:27,527 INFO L85 PathProgramCache]: Analyzing trace with hash -612654208, now seen corresponding path program 1 times [2024-10-14 03:49:27,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:27,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644257949] [2024-10-14 03:49:27,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:27,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:27,594 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-14 03:49:27,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:27,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644257949] [2024-10-14 03:49:27,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644257949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:27,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:27,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:49:27,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244774523] [2024-10-14 03:49:27,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:27,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:49:27,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:27,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:49:27,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:49:27,596 INFO L87 Difference]: Start difference. First operand 1915 states and 2588 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-14 03:49:27,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:27,640 INFO L93 Difference]: Finished difference Result 3477 states and 4749 transitions. [2024-10-14 03:49:27,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:49:27,642 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-14 03:49:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:27,645 INFO L225 Difference]: With dead ends: 3477 [2024-10-14 03:49:27,645 INFO L226 Difference]: Without dead ends: 2308 [2024-10-14 03:49:27,646 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-14 03:49:27,646 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 252 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:27,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 440 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:27,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2024-10-14 03:49:27,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 1831. [2024-10-14 03:49:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1830 states have (on average 1.3540983606557377) internal successors, (2478), 1830 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2478 transitions. [2024-10-14 03:49:27,661 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2478 transitions. Word has length 56 [2024-10-14 03:49:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:27,662 INFO L471 AbstractCegarLoop]: Abstraction has 1831 states and 2478 transitions. [2024-10-14 03:49:27,662 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-14 03:49:27,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2478 transitions. [2024-10-14 03:49:27,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:49:27,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:27,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:27,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 03:49:27,664 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-14 03:49:27,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:27,664 INFO L85 PathProgramCache]: Analyzing trace with hash 35485201, now seen corresponding path program 1 times [2024-10-14 03:49:27,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:27,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270156380] [2024-10-14 03:49:27,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:27,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:27,730 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-14 03:49:27,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:27,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270156380] [2024-10-14 03:49:27,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270156380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:27,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:27,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:49:27,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942199896] [2024-10-14 03:49:27,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:27,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:49:27,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:27,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:49:27,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:49:27,734 INFO L87 Difference]: Start difference. First operand 1831 states and 2478 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:27,789 INFO L93 Difference]: Finished difference Result 4234 states and 5888 transitions. [2024-10-14 03:49:27,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:49:27,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-14 03:49:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:27,793 INFO L225 Difference]: With dead ends: 4234 [2024-10-14 03:49:27,793 INFO L226 Difference]: Without dead ends: 3152 [2024-10-14 03:49:27,794 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-14 03:49:27,795 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 979 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:27,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 767 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2024-10-14 03:49:27,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 2743. [2024-10-14 03:49:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2743 states, 2742 states have (on average 1.3563092633114515) internal successors, (3719), 2742 states have internal predecessors, (3719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 3719 transitions. [2024-10-14 03:49:27,818 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 3719 transitions. Word has length 65 [2024-10-14 03:49:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:27,818 INFO L471 AbstractCegarLoop]: Abstraction has 2743 states and 3719 transitions. [2024-10-14 03:49:27,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 3719 transitions. [2024-10-14 03:49:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 03:49:27,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:27,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:27,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 03:49:27,821 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-14 03:49:27,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:27,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1707524859, now seen corresponding path program 1 times [2024-10-14 03:49:27,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:27,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486043420] [2024-10-14 03:49:27,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:27,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:27,895 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-14 03:49:27,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:27,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486043420] [2024-10-14 03:49:27,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486043420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:27,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:27,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:49:27,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665678524] [2024-10-14 03:49:27,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:27,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:49:27,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:27,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:49:27,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:49:27,897 INFO L87 Difference]: Start difference. First operand 2743 states and 3719 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:27,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:27,956 INFO L93 Difference]: Finished difference Result 2749 states and 3722 transitions. [2024-10-14 03:49:27,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:49:27,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-14 03:49:27,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:27,959 INFO L225 Difference]: With dead ends: 2749 [2024-10-14 03:49:27,960 INFO L226 Difference]: Without dead ends: 2298 [2024-10-14 03:49:27,960 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-14 03:49:27,961 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 497 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:27,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 792 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:27,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2024-10-14 03:49:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 2294. [2024-10-14 03:49:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2293 states have (on average 1.3597906672481466) internal successors, (3118), 2293 states have internal predecessors, (3118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:27,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 3118 transitions. [2024-10-14 03:49:27,982 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 3118 transitions. Word has length 66 [2024-10-14 03:49:27,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:27,982 INFO L471 AbstractCegarLoop]: Abstraction has 2294 states and 3118 transitions. [2024-10-14 03:49:27,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:27,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 3118 transitions. [2024-10-14 03:49:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 03:49:27,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:27,984 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-14 03:49:27,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 03:49:27,985 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-14 03:49:27,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1245623863, now seen corresponding path program 1 times [2024-10-14 03:49:27,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:27,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284271446] [2024-10-14 03:49:27,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:27,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:28,051 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-14 03:49:28,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:28,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284271446] [2024-10-14 03:49:28,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284271446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:28,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:28,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:49:28,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126573053] [2024-10-14 03:49:28,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:28,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:49:28,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:28,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:49:28,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:49:28,053 INFO L87 Difference]: Start difference. First operand 2294 states and 3118 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:28,079 INFO L93 Difference]: Finished difference Result 5310 states and 7322 transitions. [2024-10-14 03:49:28,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:49:28,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-14 03:49:28,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:28,085 INFO L225 Difference]: With dead ends: 5310 [2024-10-14 03:49:28,085 INFO L226 Difference]: Without dead ends: 3732 [2024-10-14 03:49:28,087 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-14 03:49:28,088 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 149 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:28,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 545 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3732 states. [2024-10-14 03:49:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3732 to 3522. [2024-10-14 03:49:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3522 states, 3521 states have (on average 1.3683612610053961) internal successors, (4818), 3521 states have internal predecessors, (4818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 4818 transitions. [2024-10-14 03:49:28,117 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 4818 transitions. Word has length 67 [2024-10-14 03:49:28,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:28,117 INFO L471 AbstractCegarLoop]: Abstraction has 3522 states and 4818 transitions. [2024-10-14 03:49:28,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:28,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 4818 transitions. [2024-10-14 03:49:28,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 03:49:28,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:28,119 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-14 03:49:28,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 03:49:28,119 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-14 03:49:28,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:28,120 INFO L85 PathProgramCache]: Analyzing trace with hash -44903959, now seen corresponding path program 1 times [2024-10-14 03:49:28,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:28,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011764301] [2024-10-14 03:49:28,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:28,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:28,190 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-14 03:49:28,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:28,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011764301] [2024-10-14 03:49:28,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011764301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:28,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:28,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:49:28,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863474465] [2024-10-14 03:49:28,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:28,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:49:28,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:28,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:49:28,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:49:28,193 INFO L87 Difference]: Start difference. First operand 3522 states and 4818 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-14 03:49:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:28,223 INFO L93 Difference]: Finished difference Result 8702 states and 11980 transitions. [2024-10-14 03:49:28,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:49:28,224 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-14 03:49:28,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:28,230 INFO L225 Difference]: With dead ends: 8702 [2024-10-14 03:49:28,231 INFO L226 Difference]: Without dead ends: 5746 [2024-10-14 03:49:28,235 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-14 03:49:28,235 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 153 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:28,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 533 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5746 states. [2024-10-14 03:49:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5746 to 5328. [2024-10-14 03:49:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5328 states, 5327 states have (on average 1.3576121644452788) internal successors, (7232), 5327 states have internal predecessors, (7232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5328 states to 5328 states and 7232 transitions. [2024-10-14 03:49:28,323 INFO L78 Accepts]: Start accepts. Automaton has 5328 states and 7232 transitions. Word has length 69 [2024-10-14 03:49:28,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:28,323 INFO L471 AbstractCegarLoop]: Abstraction has 5328 states and 7232 transitions. [2024-10-14 03:49:28,323 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-14 03:49:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 5328 states and 7232 transitions. [2024-10-14 03:49:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 03:49:28,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:28,325 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-14 03:49:28,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 03:49:28,325 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-14 03:49:28,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:28,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1924834057, now seen corresponding path program 1 times [2024-10-14 03:49:28,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:28,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542428701] [2024-10-14 03:49:28,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:28,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:28,396 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-14 03:49:28,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:28,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542428701] [2024-10-14 03:49:28,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542428701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:28,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:28,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:49:28,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693748732] [2024-10-14 03:49:28,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:28,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:49:28,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:28,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:49:28,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:49:28,399 INFO L87 Difference]: Start difference. First operand 5328 states and 7232 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-14 03:49:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:28,447 INFO L93 Difference]: Finished difference Result 14292 states and 19522 transitions. [2024-10-14 03:49:28,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:49:28,448 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-14 03:49:28,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:28,461 INFO L225 Difference]: With dead ends: 14292 [2024-10-14 03:49:28,462 INFO L226 Difference]: Without dead ends: 9530 [2024-10-14 03:49:28,468 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-14 03:49:28,469 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 105 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:28,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 534 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9530 states. [2024-10-14 03:49:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9530 to 8696. [2024-10-14 03:49:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8696 states, 8695 states have (on average 1.3538815411155836) internal successors, (11772), 8695 states have internal predecessors, (11772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8696 states to 8696 states and 11772 transitions. [2024-10-14 03:49:28,564 INFO L78 Accepts]: Start accepts. Automaton has 8696 states and 11772 transitions. Word has length 69 [2024-10-14 03:49:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:28,565 INFO L471 AbstractCegarLoop]: Abstraction has 8696 states and 11772 transitions. [2024-10-14 03:49:28,565 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-14 03:49:28,565 INFO L276 IsEmpty]: Start isEmpty. Operand 8696 states and 11772 transitions. [2024-10-14 03:49:28,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 03:49:28,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:28,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:28,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 03:49:28,567 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-14 03:49:28,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:28,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1192896973, now seen corresponding path program 1 times [2024-10-14 03:49:28,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:28,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914348226] [2024-10-14 03:49:28,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:28,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:28,733 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-14 03:49:28,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:28,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914348226] [2024-10-14 03:49:28,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914348226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:28,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:28,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:49:28,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2210432] [2024-10-14 03:49:28,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:28,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:49:28,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:28,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:49:28,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:49:28,734 INFO L87 Difference]: Start difference. First operand 8696 states and 11772 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:28,773 INFO L93 Difference]: Finished difference Result 9610 states and 12989 transitions. [2024-10-14 03:49:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:49:28,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-14 03:49:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:28,786 INFO L225 Difference]: With dead ends: 9610 [2024-10-14 03:49:28,786 INFO L226 Difference]: Without dead ends: 9608 [2024-10-14 03:49:28,789 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-14 03:49:28,790 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 0 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:28,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1333 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:28,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9608 states. [2024-10-14 03:49:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9608 to 9608. [2024-10-14 03:49:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9608 states, 9607 states have (on average 1.320287290517331) internal successors, (12684), 9607 states have internal predecessors, (12684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 12684 transitions. [2024-10-14 03:49:28,945 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 12684 transitions. Word has length 71 [2024-10-14 03:49:28,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:28,945 INFO L471 AbstractCegarLoop]: Abstraction has 9608 states and 12684 transitions. [2024-10-14 03:49:28,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 12684 transitions. [2024-10-14 03:49:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 03:49:28,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:28,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:28,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 03:49:28,949 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-14 03:49:28,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:28,949 INFO L85 PathProgramCache]: Analyzing trace with hash -16724346, now seen corresponding path program 1 times [2024-10-14 03:49:28,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:28,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181960106] [2024-10-14 03:49:28,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:28,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:28,993 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-14 03:49:28,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:28,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181960106] [2024-10-14 03:49:28,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181960106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:28,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:28,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:49:28,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475488266] [2024-10-14 03:49:28,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:28,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:49:28,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:28,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:49:28,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:49:28,995 INFO L87 Difference]: Start difference. First operand 9608 states and 12684 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-14 03:49:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:29,055 INFO L93 Difference]: Finished difference Result 23232 states and 30730 transitions. [2024-10-14 03:49:29,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:49:29,056 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-14 03:49:29,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:29,076 INFO L225 Difference]: With dead ends: 23232 [2024-10-14 03:49:29,076 INFO L226 Difference]: Without dead ends: 14190 [2024-10-14 03:49:29,085 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-14 03:49:29,086 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 168 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:29,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 419 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14190 states. [2024-10-14 03:49:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14190 to 14036. [2024-10-14 03:49:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14036 states, 14035 states have (on average 1.3001781261132883) internal successors, (18248), 14035 states have internal predecessors, (18248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14036 states to 14036 states and 18248 transitions. [2024-10-14 03:49:29,221 INFO L78 Accepts]: Start accepts. Automaton has 14036 states and 18248 transitions. Word has length 72 [2024-10-14 03:49:29,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:29,221 INFO L471 AbstractCegarLoop]: Abstraction has 14036 states and 18248 transitions. [2024-10-14 03:49:29,222 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-14 03:49:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 14036 states and 18248 transitions. [2024-10-14 03:49:29,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 03:49:29,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:29,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:29,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 03:49:29,224 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-14 03:49:29,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1274470703, now seen corresponding path program 1 times [2024-10-14 03:49:29,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:29,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749731414] [2024-10-14 03:49:29,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:29,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:29,304 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-14 03:49:29,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:29,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749731414] [2024-10-14 03:49:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749731414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:29,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:29,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:49:29,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254984142] [2024-10-14 03:49:29,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:29,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:49:29,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:29,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:49:29,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:49:29,306 INFO L87 Difference]: Start difference. First operand 14036 states and 18248 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:29,399 INFO L93 Difference]: Finished difference Result 20474 states and 26771 transitions. [2024-10-14 03:49:29,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:49:29,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-14 03:49:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:29,423 INFO L225 Difference]: With dead ends: 20474 [2024-10-14 03:49:29,424 INFO L226 Difference]: Without dead ends: 17070 [2024-10-14 03:49:29,431 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-14 03:49:29,432 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 600 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:29,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 889 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17070 states. [2024-10-14 03:49:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17070 to 15886. [2024-10-14 03:49:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15886 states, 15885 states have (on average 1.2961913755114889) internal successors, (20590), 15885 states have internal predecessors, (20590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15886 states to 15886 states and 20590 transitions. [2024-10-14 03:49:29,667 INFO L78 Accepts]: Start accepts. Automaton has 15886 states and 20590 transitions. Word has length 73 [2024-10-14 03:49:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:29,667 INFO L471 AbstractCegarLoop]: Abstraction has 15886 states and 20590 transitions. [2024-10-14 03:49:29,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand 15886 states and 20590 transitions. [2024-10-14 03:49:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:49:29,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:29,670 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-14 03:49:29,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 03:49:29,670 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-14 03:49:29,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:29,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2035560395, now seen corresponding path program 1 times [2024-10-14 03:49:29,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:29,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819143087] [2024-10-14 03:49:29,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:29,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:29,770 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-14 03:49:29,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:29,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819143087] [2024-10-14 03:49:29,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819143087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:29,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:29,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:49:29,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382992454] [2024-10-14 03:49:29,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:29,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:49:29,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:29,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:49:29,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:49:29,773 INFO L87 Difference]: Start difference. First operand 15886 states and 20590 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:29,880 INFO L93 Difference]: Finished difference Result 21542 states and 28083 transitions. [2024-10-14 03:49:29,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:49:29,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-14 03:49:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:29,907 INFO L225 Difference]: With dead ends: 21542 [2024-10-14 03:49:29,908 INFO L226 Difference]: Without dead ends: 18138 [2024-10-14 03:49:29,917 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-14 03:49:29,918 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 606 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:29,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 873 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:29,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18138 states. [2024-10-14 03:49:30,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18138 to 17728. [2024-10-14 03:49:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17728 states, 17727 states have (on average 1.2931122017261805) internal successors, (22923), 17727 states have internal predecessors, (22923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17728 states to 17728 states and 22923 transitions. [2024-10-14 03:49:30,118 INFO L78 Accepts]: Start accepts. Automaton has 17728 states and 22923 transitions. Word has length 75 [2024-10-14 03:49:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:30,118 INFO L471 AbstractCegarLoop]: Abstraction has 17728 states and 22923 transitions. [2024-10-14 03:49:30,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 17728 states and 22923 transitions. [2024-10-14 03:49:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:49:30,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:30,120 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-14 03:49:30,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 03:49:30,121 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-14 03:49:30,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:30,121 INFO L85 PathProgramCache]: Analyzing trace with hash -490024547, now seen corresponding path program 1 times [2024-10-14 03:49:30,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:30,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273562173] [2024-10-14 03:49:30,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:30,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:30,200 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-14 03:49:30,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:30,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273562173] [2024-10-14 03:49:30,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273562173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:30,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:30,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:49:30,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88919406] [2024-10-14 03:49:30,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:30,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:49:30,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:30,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:49:30,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:49:30,203 INFO L87 Difference]: Start difference. First operand 17728 states and 22923 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-14 03:49:30,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:30,294 INFO L93 Difference]: Finished difference Result 23352 states and 30343 transitions. [2024-10-14 03:49:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:49:30,295 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-14 03:49:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:30,317 INFO L225 Difference]: With dead ends: 23352 [2024-10-14 03:49:30,318 INFO L226 Difference]: Without dead ends: 19966 [2024-10-14 03:49:30,327 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-14 03:49:30,329 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 622 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 848 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-14 03:49:30,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 848 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:49:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19966 states. [2024-10-14 03:49:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19966 to 19556. [2024-10-14 03:49:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19556 states, 19555 states have (on average 1.290258245972897) internal successors, (25231), 19555 states have internal predecessors, (25231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:30,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19556 states to 19556 states and 25231 transitions. [2024-10-14 03:49:30,609 INFO L78 Accepts]: Start accepts. Automaton has 19556 states and 25231 transitions. Word has length 76 [2024-10-14 03:49:30,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:30,609 INFO L471 AbstractCegarLoop]: Abstraction has 19556 states and 25231 transitions. [2024-10-14 03:49:30,610 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-14 03:49:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 19556 states and 25231 transitions. [2024-10-14 03:49:30,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 03:49:30,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:30,616 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:30,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 03:49:30,616 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-14 03:49:30,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1795661640, now seen corresponding path program 1 times [2024-10-14 03:49:30,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:30,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200638721] [2024-10-14 03:49:30,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:30,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:49:30,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:30,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200638721] [2024-10-14 03:49:30,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200638721] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:49:30,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175112927] [2024-10-14 03:49:30,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:30,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:49:30,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:49:31,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:49:31,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:49:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:31,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 03:49:31,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:49:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 03:49:31,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:49:31,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175112927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:31,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:49:31,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2024-10-14 03:49:31,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051729319] [2024-10-14 03:49:31,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:31,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:49:31,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:31,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:49:31,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:49:31,482 INFO L87 Difference]: Start difference. First operand 19556 states and 25231 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:31,888 INFO L93 Difference]: Finished difference Result 42099 states and 54313 transitions. [2024-10-14 03:49:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:49:31,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-14 03:49:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:31,924 INFO L225 Difference]: With dead ends: 42099 [2024-10-14 03:49:31,924 INFO L226 Difference]: Without dead ends: 31441 [2024-10-14 03:49:31,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:49:31,940 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 806 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:31,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 844 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:49:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31441 states. [2024-10-14 03:49:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31441 to 19498. [2024-10-14 03:49:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19498 states, 19497 states have (on average 1.290506231727958) internal successors, (25161), 19497 states have internal predecessors, (25161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:32,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19498 states to 19498 states and 25161 transitions. [2024-10-14 03:49:32,228 INFO L78 Accepts]: Start accepts. Automaton has 19498 states and 25161 transitions. Word has length 91 [2024-10-14 03:49:32,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:32,228 INFO L471 AbstractCegarLoop]: Abstraction has 19498 states and 25161 transitions. [2024-10-14 03:49:32,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:32,229 INFO L276 IsEmpty]: Start isEmpty. Operand 19498 states and 25161 transitions. [2024-10-14 03:49:32,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 03:49:32,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:32,235 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:32,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:49:32,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-14 03:49:32,435 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-14 03:49:32,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:32,436 INFO L85 PathProgramCache]: Analyzing trace with hash -732608151, now seen corresponding path program 1 times [2024-10-14 03:49:32,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:32,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570387325] [2024-10-14 03:49:32,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:32,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 03:49:32,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:32,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570387325] [2024-10-14 03:49:32,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570387325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:32,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:32,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:49:32,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203650270] [2024-10-14 03:49:32,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:32,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:49:32,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:32,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:49:32,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:49:32,612 INFO L87 Difference]: Start difference. First operand 19498 states and 25161 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:33,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:33,077 INFO L93 Difference]: Finished difference Result 41336 states and 53339 transitions. [2024-10-14 03:49:33,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:49:33,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-14 03:49:33,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:33,113 INFO L225 Difference]: With dead ends: 41336 [2024-10-14 03:49:33,113 INFO L226 Difference]: Without dead ends: 30686 [2024-10-14 03:49:33,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2024-10-14 03:49:33,130 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1078 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:33,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 780 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:49:33,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30686 states. [2024-10-14 03:49:33,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30686 to 19464. [2024-10-14 03:49:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19464 states, 19463 states have (on average 1.290551302471356) internal successors, (25118), 19463 states have internal predecessors, (25118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19464 states to 19464 states and 25118 transitions. [2024-10-14 03:49:33,580 INFO L78 Accepts]: Start accepts. Automaton has 19464 states and 25118 transitions. Word has length 91 [2024-10-14 03:49:33,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:33,581 INFO L471 AbstractCegarLoop]: Abstraction has 19464 states and 25118 transitions. [2024-10-14 03:49:33,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 19464 states and 25118 transitions. [2024-10-14 03:49:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:49:33,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:33,587 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:33,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-14 03:49:33,587 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-14 03:49:33,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:33,589 INFO L85 PathProgramCache]: Analyzing trace with hash -365813274, now seen corresponding path program 1 times [2024-10-14 03:49:33,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:33,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077413449] [2024-10-14 03:49:33,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:33,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:49:33,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:33,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077413449] [2024-10-14 03:49:33,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077413449] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:49:33,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055463372] [2024-10-14 03:49:33,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:33,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:49:33,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:49:33,933 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:49:33,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:49:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:34,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 03:49:34,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:49:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:49:35,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:49:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:49:36,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055463372] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:49:36,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:49:36,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 13] total 28 [2024-10-14 03:49:36,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632942375] [2024-10-14 03:49:36,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:49:36,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 03:49:36,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:36,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 03:49:36,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2024-10-14 03:49:36,054 INFO L87 Difference]: Start difference. First operand 19464 states and 25118 transitions. Second operand has 29 states, 29 states have (on average 7.931034482758621) internal successors, (230), 28 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:47,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:47,429 INFO L93 Difference]: Finished difference Result 158205 states and 200902 transitions. [2024-10-14 03:49:47,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2024-10-14 03:49:47,430 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.931034482758621) internal successors, (230), 28 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-14 03:49:47,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:47,635 INFO L225 Difference]: With dead ends: 158205 [2024-10-14 03:49:47,635 INFO L226 Difference]: Without dead ends: 147663 [2024-10-14 03:49:47,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14892 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=6348, Invalid=33852, Unknown=0, NotChecked=0, Total=40200 [2024-10-14 03:49:47,680 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 6477 mSDsluCounter, 7590 mSDsCounter, 0 mSdLazyCounter, 7075 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6477 SdHoareTripleChecker+Valid, 8113 SdHoareTripleChecker+Invalid, 7203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 7075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:47,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6477 Valid, 8113 Invalid, 7203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 7075 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 03:49:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147663 states. [2024-10-14 03:49:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147663 to 20301. [2024-10-14 03:49:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20301 states, 20300 states have (on average 1.2881773399014778) internal successors, (26150), 20300 states have internal predecessors, (26150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20301 states to 20301 states and 26150 transitions. [2024-10-14 03:49:48,715 INFO L78 Accepts]: Start accepts. Automaton has 20301 states and 26150 transitions. Word has length 92 [2024-10-14 03:49:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:48,715 INFO L471 AbstractCegarLoop]: Abstraction has 20301 states and 26150 transitions. [2024-10-14 03:49:48,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.931034482758621) internal successors, (230), 28 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 20301 states and 26150 transitions. [2024-10-14 03:49:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:49:48,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:48,725 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:48,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 03:49:48,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-14 03:49:48,929 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-14 03:49:48,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:48,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1504612839, now seen corresponding path program 1 times [2024-10-14 03:49:48,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:48,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424501651] [2024-10-14 03:49:48,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:49,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:49:49,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:49,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424501651] [2024-10-14 03:49:49,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424501651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:49:49,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:49:49,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:49:49,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539590824] [2024-10-14 03:49:49,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:49:49,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 03:49:49,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:49,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 03:49:49,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:49:49,506 INFO L87 Difference]: Start difference. First operand 20301 states and 26150 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:49:50,253 INFO L93 Difference]: Finished difference Result 48604 states and 62447 transitions. [2024-10-14 03:49:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:49:50,253 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-14 03:49:50,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:49:50,301 INFO L225 Difference]: With dead ends: 48604 [2024-10-14 03:49:50,302 INFO L226 Difference]: Without dead ends: 37977 [2024-10-14 03:49:50,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2024-10-14 03:49:50,320 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 1153 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:49:50,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1011 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:49:50,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37977 states. [2024-10-14 03:49:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37977 to 32777. [2024-10-14 03:49:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32777 states, 32776 states have (on average 1.2878020502806933) internal successors, (42209), 32776 states have internal predecessors, (42209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:51,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32777 states to 32777 states and 42209 transitions. [2024-10-14 03:49:51,012 INFO L78 Accepts]: Start accepts. Automaton has 32777 states and 42209 transitions. Word has length 92 [2024-10-14 03:49:51,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:49:51,012 INFO L471 AbstractCegarLoop]: Abstraction has 32777 states and 42209 transitions. [2024-10-14 03:49:51,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:49:51,012 INFO L276 IsEmpty]: Start isEmpty. Operand 32777 states and 42209 transitions. [2024-10-14 03:49:51,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:49:51,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:49:51,023 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:49:51,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-14 03:49:51,023 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-14 03:49:51,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:49:51,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1675726985, now seen corresponding path program 1 times [2024-10-14 03:49:51,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:49:51,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684324530] [2024-10-14 03:49:51,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:51,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:49:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:51,269 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-14 03:49:51,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:49:51,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684324530] [2024-10-14 03:49:51,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684324530] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:49:51,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756011848] [2024-10-14 03:49:51,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:49:51,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:49:51,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:49:51,272 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:49:51,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:49:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:49:51,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 03:49:51,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:49:52,289 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-14 03:49:52,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:49:53,008 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-14 03:49:53,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756011848] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:49:53,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:49:53,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 27 [2024-10-14 03:49:53,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97833838] [2024-10-14 03:49:53,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:49:53,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 03:49:53,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:53,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 03:49:53,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2024-10-14 03:49:53,011 INFO L87 Difference]: Start difference. First operand 32777 states and 42209 transitions. Second operand has 28 states, 28 states have (on average 8.535714285714286) internal successors, (239), 27 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:01,979 INFO L93 Difference]: Finished difference Result 179060 states and 228086 transitions. [2024-10-14 03:50:01,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-10-14 03:50:01,980 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.535714285714286) internal successors, (239), 27 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-14 03:50:01,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:02,204 INFO L225 Difference]: With dead ends: 179060 [2024-10-14 03:50:02,205 INFO L226 Difference]: Without dead ends: 162910 [2024-10-14 03:50:02,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12138 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5514, Invalid=25638, Unknown=0, NotChecked=0, Total=31152 [2024-10-14 03:50:02,247 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 4515 mSDsluCounter, 5219 mSDsCounter, 0 mSdLazyCounter, 5533 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4515 SdHoareTripleChecker+Valid, 5635 SdHoareTripleChecker+Invalid, 5635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 5533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:02,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4515 Valid, 5635 Invalid, 5635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 5533 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 03:50:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162910 states. [2024-10-14 03:50:03,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162910 to 64370. [2024-10-14 03:50:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64370 states, 64369 states have (on average 1.2881045223632495) internal successors, (82914), 64369 states have internal predecessors, (82914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64370 states to 64370 states and 82914 transitions. [2024-10-14 03:50:03,777 INFO L78 Accepts]: Start accepts. Automaton has 64370 states and 82914 transitions. Word has length 92 [2024-10-14 03:50:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:03,779 INFO L471 AbstractCegarLoop]: Abstraction has 64370 states and 82914 transitions. [2024-10-14 03:50:03,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.535714285714286) internal successors, (239), 27 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 64370 states and 82914 transitions. [2024-10-14 03:50:03,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:50:03,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:03,803 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:50:03,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 03:50:04,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:50:04,004 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-14 03:50:04,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:04,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1965411061, now seen corresponding path program 1 times [2024-10-14 03:50:04,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:04,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322108206] [2024-10-14 03:50:04,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:04,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 03:50:04,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:04,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322108206] [2024-10-14 03:50:04,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322108206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:04,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:04,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:50:04,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904484654] [2024-10-14 03:50:04,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:04,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:50:04,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:04,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:50:04,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:50:04,109 INFO L87 Difference]: Start difference. First operand 64370 states and 82914 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:04,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:04,844 INFO L93 Difference]: Finished difference Result 125645 states and 162238 transitions. [2024-10-14 03:50:04,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:50:04,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-14 03:50:04,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:04,948 INFO L225 Difference]: With dead ends: 125645 [2024-10-14 03:50:04,948 INFO L226 Difference]: Without dead ends: 63696 [2024-10-14 03:50:04,964 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-14 03:50:04,964 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 209 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:04,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 254 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:50:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63696 states. [2024-10-14 03:50:05,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63696 to 63696. [2024-10-14 03:50:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63696 states, 63695 states have (on average 1.2756260303006515) internal successors, (81251), 63695 states have internal predecessors, (81251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63696 states to 63696 states and 81251 transitions. [2024-10-14 03:50:05,711 INFO L78 Accepts]: Start accepts. Automaton has 63696 states and 81251 transitions. Word has length 93 [2024-10-14 03:50:05,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:05,711 INFO L471 AbstractCegarLoop]: Abstraction has 63696 states and 81251 transitions. [2024-10-14 03:50:05,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 63696 states and 81251 transitions. [2024-10-14 03:50:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:50:05,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:05,719 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:50:05,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-14 03:50:05,720 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-14 03:50:05,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:05,720 INFO L85 PathProgramCache]: Analyzing trace with hash -225364972, now seen corresponding path program 1 times [2024-10-14 03:50:05,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:05,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50990992] [2024-10-14 03:50:05,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:05,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:05,834 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-14 03:50:05,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:05,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50990992] [2024-10-14 03:50:05,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50990992] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:50:05,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380198081] [2024-10-14 03:50:05,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:05,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:50:05,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:50:05,837 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:50:05,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 03:50:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:06,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 03:50:06,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:50:07,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 03:50:07,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:50:07,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380198081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:07,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:50:07,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 16 [2024-10-14 03:50:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916928951] [2024-10-14 03:50:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:07,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:50:07,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:07,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:50:07,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:50:07,071 INFO L87 Difference]: Start difference. First operand 63696 states and 81251 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:08,006 INFO L93 Difference]: Finished difference Result 146931 states and 187725 transitions. [2024-10-14 03:50:08,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:50:08,006 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-14 03:50:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:08,177 INFO L225 Difference]: With dead ends: 146931 [2024-10-14 03:50:08,177 INFO L226 Difference]: Without dead ends: 127943 [2024-10-14 03:50:08,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:50:08,214 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 1360 mSDsluCounter, 2551 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 2918 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:08,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 2918 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:50:08,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127943 states. [2024-10-14 03:50:09,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127943 to 67619. [2024-10-14 03:50:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67619 states, 67618 states have (on average 1.2761838563696057) internal successors, (86293), 67618 states have internal predecessors, (86293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67619 states to 67619 states and 86293 transitions. [2024-10-14 03:50:09,467 INFO L78 Accepts]: Start accepts. Automaton has 67619 states and 86293 transitions. Word has length 93 [2024-10-14 03:50:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:09,467 INFO L471 AbstractCegarLoop]: Abstraction has 67619 states and 86293 transitions. [2024-10-14 03:50:09,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 67619 states and 86293 transitions. [2024-10-14 03:50:09,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:50:09,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:09,478 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:50:09,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 03:50:09,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-14 03:50:09,683 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 03:50:09,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1919374985, now seen corresponding path program 1 times [2024-10-14 03:50:09,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:09,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515187021] [2024-10-14 03:50:09,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:09,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:09,824 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-14 03:50:09,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:09,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515187021] [2024-10-14 03:50:09,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515187021] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:50:09,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951350139] [2024-10-14 03:50:09,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:09,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:50:09,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:50:09,828 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:50:09,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 03:50:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:10,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 03:50:10,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:50:10,548 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-14 03:50:10,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:50:11,071 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-14 03:50:11,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951350139] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:50:11,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:50:11,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2024-10-14 03:50:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824899988] [2024-10-14 03:50:11,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:50:11,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:50:11,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:11,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:50:11,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:50:11,073 INFO L87 Difference]: Start difference. First operand 67619 states and 86293 transitions. Second operand has 13 states, 13 states have (on average 17.076923076923077) internal successors, (222), 13 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:12,464 INFO L93 Difference]: Finished difference Result 340439 states and 433420 transitions. [2024-10-14 03:50:12,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 03:50:12,464 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 17.076923076923077) internal successors, (222), 13 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-14 03:50:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:13,051 INFO L225 Difference]: With dead ends: 340439 [2024-10-14 03:50:13,052 INFO L226 Difference]: Without dead ends: 274904 [2024-10-14 03:50:13,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=787, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 03:50:13,137 INFO L432 NwaCegarLoop]: 743 mSDtfsCounter, 2624 mSDsluCounter, 2390 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2624 SdHoareTripleChecker+Valid, 3133 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:13,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2624 Valid, 3133 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:50:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274904 states. [2024-10-14 03:50:15,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274904 to 240248. [2024-10-14 03:50:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240248 states, 240247 states have (on average 1.2618596694235515) internal successors, (303158), 240247 states have internal predecessors, (303158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240248 states to 240248 states and 303158 transitions. [2024-10-14 03:50:17,159 INFO L78 Accepts]: Start accepts. Automaton has 240248 states and 303158 transitions. Word has length 93 [2024-10-14 03:50:17,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:17,159 INFO L471 AbstractCegarLoop]: Abstraction has 240248 states and 303158 transitions. [2024-10-14 03:50:17,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.076923076923077) internal successors, (222), 13 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 240248 states and 303158 transitions. [2024-10-14 03:50:17,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 03:50:17,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:17,179 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] [2024-10-14 03:50:17,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 03:50:17,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-10-14 03:50:17,381 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 03:50:17,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash -899942983, now seen corresponding path program 1 times [2024-10-14 03:50:17,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:17,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832701410] [2024-10-14 03:50:17,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:17,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 03:50:17,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:17,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832701410] [2024-10-14 03:50:17,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832701410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:17,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:17,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:50:17,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013920127] [2024-10-14 03:50:17,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:17,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:50:17,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:17,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:50:17,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:50:17,481 INFO L87 Difference]: Start difference. First operand 240248 states and 303158 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:19,678 INFO L93 Difference]: Finished difference Result 446564 states and 564179 transitions. [2024-10-14 03:50:19,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:50:19,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 98 [2024-10-14 03:50:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:20,054 INFO L225 Difference]: With dead ends: 446564 [2024-10-14 03:50:20,054 INFO L226 Difference]: Without dead ends: 207517 [2024-10-14 03:50:20,158 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-14 03:50:20,162 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 208 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:20,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 233 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:50:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207517 states. [2024-10-14 03:50:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207517 to 207517. [2024-10-14 03:50:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207517 states, 207516 states have (on average 1.2461545133869196) internal successors, (258597), 207516 states have internal predecessors, (258597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207517 states to 207517 states and 258597 transitions. [2024-10-14 03:50:23,928 INFO L78 Accepts]: Start accepts. Automaton has 207517 states and 258597 transitions. Word has length 98 [2024-10-14 03:50:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:23,929 INFO L471 AbstractCegarLoop]: Abstraction has 207517 states and 258597 transitions. [2024-10-14 03:50:23,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 207517 states and 258597 transitions. [2024-10-14 03:50:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:50:23,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:23,952 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] [2024-10-14 03:50:23,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-14 03:50:23,953 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 03:50:23,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:23,953 INFO L85 PathProgramCache]: Analyzing trace with hash -565270020, now seen corresponding path program 1 times [2024-10-14 03:50:23,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:23,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901118040] [2024-10-14 03:50:23,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:23,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:24,595 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-14 03:50:24,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:24,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901118040] [2024-10-14 03:50:24,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901118040] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:50:24,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875325424] [2024-10-14 03:50:24,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:24,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:50:24,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:50:24,602 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:50:24,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 03:50:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:24,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 03:50:24,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:50:25,104 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-14 03:50:25,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:50:25,230 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-14 03:50:25,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875325424] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:50:25,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:50:25,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-10-14 03:50:25,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370728344] [2024-10-14 03:50:25,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:50:25,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 03:50:25,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:25,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 03:50:25,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:50:25,233 INFO L87 Difference]: Start difference. First operand 207517 states and 258597 transitions. Second operand has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 14 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:27,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:27,317 INFO L93 Difference]: Finished difference Result 415797 states and 516453 transitions. [2024-10-14 03:50:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:50:27,318 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 14 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-14 03:50:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:27,754 INFO L225 Difference]: With dead ends: 415797 [2024-10-14 03:50:27,754 INFO L226 Difference]: Without dead ends: 226407 [2024-10-14 03:50:27,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 190 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-14 03:50:27,829 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 2126 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2126 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:27,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2126 Valid, 914 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:50:27,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226407 states. [2024-10-14 03:50:30,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226407 to 209425. [2024-10-14 03:50:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209425 states, 209424 states have (on average 1.2345146688058675) internal successors, (258537), 209424 states have internal predecessors, (258537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209425 states to 209425 states and 258537 transitions. [2024-10-14 03:50:30,958 INFO L78 Accepts]: Start accepts. Automaton has 209425 states and 258537 transitions. Word has length 99 [2024-10-14 03:50:30,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:30,958 INFO L471 AbstractCegarLoop]: Abstraction has 209425 states and 258537 transitions. [2024-10-14 03:50:30,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 14 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:30,959 INFO L276 IsEmpty]: Start isEmpty. Operand 209425 states and 258537 transitions. [2024-10-14 03:50:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:50:30,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:30,971 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-14 03:50:30,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 03:50:31,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:50:31,172 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 03:50:31,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:31,173 INFO L85 PathProgramCache]: Analyzing trace with hash 356644248, now seen corresponding path program 1 times [2024-10-14 03:50:31,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:31,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914716104] [2024-10-14 03:50:31,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:31,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:31,266 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-14 03:50:31,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:31,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914716104] [2024-10-14 03:50:31,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914716104] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:50:31,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448258959] [2024-10-14 03:50:31,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:31,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:50:31,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:50:31,268 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:50:31,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 03:50:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:32,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 03:50:32,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:50:32,347 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-14 03:50:32,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:50:32,461 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-14 03:50:32,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448258959] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:50:32,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:50:32,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-10-14 03:50:32,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29763038] [2024-10-14 03:50:32,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:50:32,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 03:50:32,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:32,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 03:50:32,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:50:32,464 INFO L87 Difference]: Start difference. First operand 209425 states and 258537 transitions. Second operand has 14 states, 14 states have (on average 19.642857142857142) internal successors, (275), 14 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:50:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:33,966 INFO L93 Difference]: Finished difference Result 453159 states and 557131 transitions. [2024-10-14 03:50:33,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:50:33,966 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.642857142857142) internal successors, (275), 14 states have internal predecessors, (275), 0 states have call successors, (0), 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-14 03:50:33,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:35,214 INFO L225 Difference]: With dead ends: 453159 [2024-10-14 03:50:35,214 INFO L226 Difference]: Without dead ends: 245521