./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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8903dcb91a7500453f98b743541ef164d589c2f5828e51ac11fb5ea90b79c3dd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:45:30,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:45:30,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:45:30,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:45:30,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:45:30,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:45:30,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:45:30,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:45:30,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:45:30,969 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:45:30,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:45:30,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:45:30,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:45:30,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:45:30,972 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:45:30,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:45:30,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:45:30,973 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:45:30,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:45:30,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:45:30,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:45:30,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:45:30,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:45:30,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:45:30,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:45:30,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:45:30,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:45:30,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:45:30,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:45:30,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:45:30,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:45:30,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:45:30,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:45:30,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:45:30,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:45:30,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:45:30,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:45:30,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:45:30,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:45:30,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:45:30,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:45:30,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:45:30,983 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8903dcb91a7500453f98b743541ef164d589c2f5828e51ac11fb5ea90b79c3dd [2024-10-11 03:45:31,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:45:31,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:45:31,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:45:31,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:45:31,267 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:45:31,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-11 03:45:32,659 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:45:32,955 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:45:32,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-11 03:45:32,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/546f578d1/93260a6384084313a60220eaeb24be5f/FLAG0e1a393e1 [2024-10-11 03:45:33,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/546f578d1/93260a6384084313a60220eaeb24be5f [2024-10-11 03:45:33,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:45:33,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:45:33,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:45:33,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:45:33,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:45:33,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:45:33" (1/1) ... [2024-10-11 03:45:33,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@117ce932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:33, skipping insertion in model container [2024-10-11 03:45:33,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:45:33" (1/1) ... [2024-10-11 03:45:33,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:45:33,536 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7543,7556] [2024-10-11 03:45:33,553 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10430,10443] [2024-10-11 03:45:33,565 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11521,11534] [2024-10-11 03:45:33,573 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12127,12140] [2024-10-11 03:45:33,582 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13546,13559] [2024-10-11 03:45:33,588 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14152,14165] [2024-10-11 03:45:33,598 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15123,15136] [2024-10-11 03:45:33,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:45:33,660 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:45:33,709 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7543,7556] [2024-10-11 03:45:33,724 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10430,10443] [2024-10-11 03:45:33,731 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11521,11534] [2024-10-11 03:45:33,734 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12127,12140] [2024-10-11 03:45:33,745 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13546,13559] [2024-10-11 03:45:33,748 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14152,14165] [2024-10-11 03:45:33,754 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15123,15136] [2024-10-11 03:45:33,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:45:33,800 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:45:33,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:33 WrapperNode [2024-10-11 03:45:33,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:45:33,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:45:33,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:45:33,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:45:33,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:33" (1/1) ... [2024-10-11 03:45:33,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:33" (1/1) ... [2024-10-11 03:45:33,896 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1104 [2024-10-11 03:45:33,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:45:33,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:45:33,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:45:33,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:45:33,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:33" (1/1) ... [2024-10-11 03:45:33,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:33" (1/1) ... [2024-10-11 03:45:33,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:33" (1/1) ... [2024-10-11 03:45:33,938 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:45:33,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:33" (1/1) ... [2024-10-11 03:45:33,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:33" (1/1) ... [2024-10-11 03:45:33,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:33" (1/1) ... [2024-10-11 03:45:33,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:33" (1/1) ... [2024-10-11 03:45:33,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:33" (1/1) ... [2024-10-11 03:45:33,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:33" (1/1) ... [2024-10-11 03:45:33,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:45:34,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:45:34,002 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:45:34,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:45:34,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:33" (1/1) ... [2024-10-11 03:45:34,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:45:34,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:45:34,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:45:34,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:45:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:45:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:45:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:45:34,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:45:34,237 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:45:34,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:45:35,158 INFO L? ?]: Removed 178 outVars from TransFormulas that were not future-live. [2024-10-11 03:45:35,158 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:45:35,208 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:45:35,208 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:45:35,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:45:35 BoogieIcfgContainer [2024-10-11 03:45:35,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:45:35,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:45:35,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:45:35,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:45:35,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:45:33" (1/3) ... [2024-10-11 03:45:35,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a831689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:45:35, skipping insertion in model container [2024-10-11 03:45:35,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:33" (2/3) ... [2024-10-11 03:45:35,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a831689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:45:35, skipping insertion in model container [2024-10-11 03:45:35,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:45:35" (3/3) ... [2024-10-11 03:45:35,220 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-11 03:45:35,234 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:45:35,234 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-11 03:45:35,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:45:35,301 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;@3c0966cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:45:35,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 03:45:35,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 197 states have (on average 1.83248730964467) internal successors, (361), 204 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 03:45:35,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:35,320 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] [2024-10-11 03:45:35,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:35,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:35,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1273195572, now seen corresponding path program 1 times [2024-10-11 03:45:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:35,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068668732] [2024-10-11 03:45:35,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:35,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:35,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068668732] [2024-10-11 03:45:35,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068668732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:35,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:35,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:45:35,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372349402] [2024-10-11 03:45:35,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:35,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:35,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:35,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:35,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:35,946 INFO L87 Difference]: Start difference. First operand has 205 states, 197 states have (on average 1.83248730964467) internal successors, (361), 204 states have internal predecessors, (361), 0 states have call successors, (0), 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.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:36,206 INFO L93 Difference]: Finished difference Result 334 states and 565 transitions. [2024-10-11 03:45:36,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:36,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-11 03:45:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:36,221 INFO L225 Difference]: With dead ends: 334 [2024-10-11 03:45:36,221 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 03:45:36,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:45:36,230 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 854 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:36,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 239 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:45:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 03:45:36,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-10-11 03:45:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 176 states have (on average 1.2727272727272727) internal successors, (224), 182 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 224 transitions. [2024-10-11 03:45:36,275 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 224 transitions. Word has length 46 [2024-10-11 03:45:36,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:36,276 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 224 transitions. [2024-10-11 03:45:36,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 224 transitions. [2024-10-11 03:45:36,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 03:45:36,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:36,281 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] [2024-10-11 03:45:36,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:45:36,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:36,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:36,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1862883361, now seen corresponding path program 1 times [2024-10-11 03:45:36,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:36,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267159054] [2024-10-11 03:45:36,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:36,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:36,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:36,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267159054] [2024-10-11 03:45:36,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267159054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:36,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:36,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:45:36,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125643240] [2024-10-11 03:45:36,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:36,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:36,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:36,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:36,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:36,478 INFO L87 Difference]: Start difference. First operand 183 states and 224 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:36,624 INFO L93 Difference]: Finished difference Result 306 states and 385 transitions. [2024-10-11 03:45:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:36,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-10-11 03:45:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:36,626 INFO L225 Difference]: With dead ends: 306 [2024-10-11 03:45:36,626 INFO L226 Difference]: Without dead ends: 164 [2024-10-11 03:45:36,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:45:36,628 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 578 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:36,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 125 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:45:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-11 03:45:36,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-10-11 03:45:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 157 states have (on average 1.286624203821656) internal successors, (202), 163 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 202 transitions. [2024-10-11 03:45:36,645 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 202 transitions. Word has length 47 [2024-10-11 03:45:36,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:36,645 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 202 transitions. [2024-10-11 03:45:36,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2024-10-11 03:45:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:45:36,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:36,648 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] [2024-10-11 03:45:36,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:45:36,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:36,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:36,650 INFO L85 PathProgramCache]: Analyzing trace with hash 135868934, now seen corresponding path program 1 times [2024-10-11 03:45:36,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:36,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432586593] [2024-10-11 03:45:36,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:36,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:36,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:36,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432586593] [2024-10-11 03:45:36,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432586593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:36,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:36,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:45:36,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189444746] [2024-10-11 03:45:36,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:36,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:36,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:36,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:36,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:36,795 INFO L87 Difference]: Start difference. First operand 164 states and 202 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:36,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:36,916 INFO L93 Difference]: Finished difference Result 287 states and 362 transitions. [2024-10-11 03:45:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:36,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-11 03:45:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:36,918 INFO L225 Difference]: With dead ends: 287 [2024-10-11 03:45:36,918 INFO L226 Difference]: Without dead ends: 156 [2024-10-11 03:45:36,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:45:36,920 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 536 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:36,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 124 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:45:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-11 03:45:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-10-11 03:45:36,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 155 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 192 transitions. [2024-10-11 03:45:36,937 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 192 transitions. Word has length 48 [2024-10-11 03:45:36,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:36,937 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 192 transitions. [2024-10-11 03:45:36,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:36,937 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 192 transitions. [2024-10-11 03:45:36,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:45:36,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:36,939 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-11 03:45:36,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:45:36,939 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:36,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:36,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1731915121, now seen corresponding path program 1 times [2024-10-11 03:45:36,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:36,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971715341] [2024-10-11 03:45:36,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:36,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:37,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:37,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971715341] [2024-10-11 03:45:37,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971715341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:37,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:37,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:45:37,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540360611] [2024-10-11 03:45:37,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:37,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:45:37,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:37,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:45:37,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:45:37,290 INFO L87 Difference]: Start difference. First operand 156 states and 192 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 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-11 03:45:37,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:37,700 INFO L93 Difference]: Finished difference Result 243 states and 302 transitions. [2024-10-11 03:45:37,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:45:37,701 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 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-11 03:45:37,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:37,703 INFO L225 Difference]: With dead ends: 243 [2024-10-11 03:45:37,703 INFO L226 Difference]: Without dead ends: 238 [2024-10-11 03:45:37,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:45:37,705 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 583 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:37,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 611 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:45:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-11 03:45:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 156. [2024-10-11 03:45:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 155 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 191 transitions. [2024-10-11 03:45:37,721 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 191 transitions. Word has length 49 [2024-10-11 03:45:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:37,721 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 191 transitions. [2024-10-11 03:45:37,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 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-11 03:45:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 191 transitions. [2024-10-11 03:45:37,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:45:37,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:37,723 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-11 03:45:37,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:45:37,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:37,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:37,724 INFO L85 PathProgramCache]: Analyzing trace with hash -650855073, now seen corresponding path program 1 times [2024-10-11 03:45:37,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:37,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310048235] [2024-10-11 03:45:37,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:37,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:37,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:37,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310048235] [2024-10-11 03:45:37,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310048235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:37,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:37,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:45:37,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164253789] [2024-10-11 03:45:37,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:37,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:45:37,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:37,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:45:37,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:45:37,990 INFO L87 Difference]: Start difference. First operand 156 states and 191 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 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-11 03:45:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:38,359 INFO L93 Difference]: Finished difference Result 302 states and 385 transitions. [2024-10-11 03:45:38,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:45:38,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 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-11 03:45:38,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:38,362 INFO L225 Difference]: With dead ends: 302 [2024-10-11 03:45:38,363 INFO L226 Difference]: Without dead ends: 242 [2024-10-11 03:45:38,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:45:38,365 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 393 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:38,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 628 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:45:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-11 03:45:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 156. [2024-10-11 03:45:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 155 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 190 transitions. [2024-10-11 03:45:38,377 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 190 transitions. Word has length 49 [2024-10-11 03:45:38,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:38,377 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 190 transitions. [2024-10-11 03:45:38,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 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-11 03:45:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 190 transitions. [2024-10-11 03:45:38,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:45:38,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:38,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:38,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:45:38,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:38,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:38,383 INFO L85 PathProgramCache]: Analyzing trace with hash 622927837, now seen corresponding path program 1 times [2024-10-11 03:45:38,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:38,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235615534] [2024-10-11 03:45:38,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:38,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:38,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:38,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:38,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235615534] [2024-10-11 03:45:38,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235615534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:38,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:38,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:45:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419143318] [2024-10-11 03:45:38,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:38,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:45:38,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:38,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:45:38,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:45:38,649 INFO L87 Difference]: Start difference. First operand 156 states and 190 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 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-11 03:45:38,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:38,968 INFO L93 Difference]: Finished difference Result 311 states and 388 transitions. [2024-10-11 03:45:38,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:45:38,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 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-11 03:45:38,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:38,970 INFO L225 Difference]: With dead ends: 311 [2024-10-11 03:45:38,970 INFO L226 Difference]: Without dead ends: 228 [2024-10-11 03:45:38,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:45:38,972 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 521 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:38,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 509 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:45:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-11 03:45:38,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 156. [2024-10-11 03:45:38,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2684563758389262) internal successors, (189), 155 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 189 transitions. [2024-10-11 03:45:38,977 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 189 transitions. Word has length 49 [2024-10-11 03:45:38,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:38,978 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 189 transitions. [2024-10-11 03:45:38,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 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-11 03:45:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 189 transitions. [2024-10-11 03:45:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:45:38,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:38,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:38,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:45:38,980 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:38,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash 359581070, now seen corresponding path program 1 times [2024-10-11 03:45:38,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:38,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096334639] [2024-10-11 03:45:38,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:38,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:39,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:39,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096334639] [2024-10-11 03:45:39,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096334639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:39,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:39,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:45:39,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051737664] [2024-10-11 03:45:39,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:39,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:45:39,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:39,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:45:39,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:45:39,667 INFO L87 Difference]: Start difference. First operand 156 states and 189 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:40,462 INFO L93 Difference]: Finished difference Result 405 states and 518 transitions. [2024-10-11 03:45:40,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:45:40,462 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-11 03:45:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:40,464 INFO L225 Difference]: With dead ends: 405 [2024-10-11 03:45:40,464 INFO L226 Difference]: Without dead ends: 358 [2024-10-11 03:45:40,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:45:40,466 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 927 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:40,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 1333 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:45:40,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-11 03:45:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 152. [2024-10-11 03:45:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 146 states have (on average 1.2602739726027397) internal successors, (184), 151 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 184 transitions. [2024-10-11 03:45:40,473 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 184 transitions. Word has length 51 [2024-10-11 03:45:40,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:40,475 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 184 transitions. [2024-10-11 03:45:40,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 184 transitions. [2024-10-11 03:45:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:45:40,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:40,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:40,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:45:40,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:40,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:40,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1420936078, now seen corresponding path program 1 times [2024-10-11 03:45:40,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:40,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536846745] [2024-10-11 03:45:40,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:40,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:40,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:40,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536846745] [2024-10-11 03:45:40,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536846745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:40,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:40,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:45:40,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120311177] [2024-10-11 03:45:40,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:40,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:45:40,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:40,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:45:40,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:45:40,947 INFO L87 Difference]: Start difference. First operand 152 states and 184 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:41,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:41,400 INFO L93 Difference]: Finished difference Result 395 states and 511 transitions. [2024-10-11 03:45:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:45:41,401 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-11 03:45:41,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:41,403 INFO L225 Difference]: With dead ends: 395 [2024-10-11 03:45:41,404 INFO L226 Difference]: Without dead ends: 323 [2024-10-11 03:45:41,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:45:41,405 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 753 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:41,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1156 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:45:41,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-11 03:45:41,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 123. [2024-10-11 03:45:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.2605042016806722) internal successors, (150), 122 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2024-10-11 03:45:41,414 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 51 [2024-10-11 03:45:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:41,414 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2024-10-11 03:45:41,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2024-10-11 03:45:41,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:45:41,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:41,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:41,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:45:41,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:41,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:41,416 INFO L85 PathProgramCache]: Analyzing trace with hash -83474213, now seen corresponding path program 1 times [2024-10-11 03:45:41,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:41,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590428831] [2024-10-11 03:45:41,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:41,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:42,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:42,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590428831] [2024-10-11 03:45:42,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590428831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:42,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:42,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 03:45:42,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539783319] [2024-10-11 03:45:42,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:42,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 03:45:42,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:42,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 03:45:42,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:45:42,329 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:43,459 INFO L93 Difference]: Finished difference Result 277 states and 351 transitions. [2024-10-11 03:45:43,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:45:43,460 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-11 03:45:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:43,462 INFO L225 Difference]: With dead ends: 277 [2024-10-11 03:45:43,462 INFO L226 Difference]: Without dead ends: 273 [2024-10-11 03:45:43,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 03:45:43,465 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 787 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:43,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 2064 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:45:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-11 03:45:43,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 133. [2024-10-11 03:45:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 129 states have (on average 1.2790697674418605) internal successors, (165), 132 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 165 transitions. [2024-10-11 03:45:43,473 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 165 transitions. Word has length 51 [2024-10-11 03:45:43,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:43,474 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 165 transitions. [2024-10-11 03:45:43,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2024-10-11 03:45:43,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:45:43,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:43,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:43,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:45:43,476 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:43,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:43,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2094676409, now seen corresponding path program 1 times [2024-10-11 03:45:43,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:43,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160481902] [2024-10-11 03:45:43,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:43,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:44,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:44,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160481902] [2024-10-11 03:45:44,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160481902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:44,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:44,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 03:45:44,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190401198] [2024-10-11 03:45:44,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:44,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 03:45:44,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:44,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 03:45:44,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:45:44,386 INFO L87 Difference]: Start difference. First operand 133 states and 165 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:45,334 INFO L93 Difference]: Finished difference Result 265 states and 340 transitions. [2024-10-11 03:45:45,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:45:45,335 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 03:45:45,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:45,336 INFO L225 Difference]: With dead ends: 265 [2024-10-11 03:45:45,336 INFO L226 Difference]: Without dead ends: 249 [2024-10-11 03:45:45,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2024-10-11 03:45:45,337 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 934 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:45,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1757 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:45:45,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-11 03:45:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 125. [2024-10-11 03:45:45,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 124 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:45,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2024-10-11 03:45:45,344 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 154 transitions. Word has length 52 [2024-10-11 03:45:45,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:45,344 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 154 transitions. [2024-10-11 03:45:45,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:45,344 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 154 transitions. [2024-10-11 03:45:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:45:45,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:45,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:45,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:45:45,346 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:45,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:45,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1872189982, now seen corresponding path program 1 times [2024-10-11 03:45:45,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:45,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396071486] [2024-10-11 03:45:45,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:45,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:45,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:45,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396071486] [2024-10-11 03:45:45,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396071486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:45,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:45,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:45:45,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954077977] [2024-10-11 03:45:45,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:45,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:45:45,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:45,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:45:45,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:45:45,580 INFO L87 Difference]: Start difference. First operand 125 states and 154 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:45,849 INFO L93 Difference]: Finished difference Result 196 states and 246 transitions. [2024-10-11 03:45:45,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:45:45,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 03:45:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:45,851 INFO L225 Difference]: With dead ends: 196 [2024-10-11 03:45:45,851 INFO L226 Difference]: Without dead ends: 189 [2024-10-11 03:45:45,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:45:45,852 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 435 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:45,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 467 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:45:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-11 03:45:45,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 125. [2024-10-11 03:45:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 124 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:45,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2024-10-11 03:45:45,856 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 52 [2024-10-11 03:45:45,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:45,856 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2024-10-11 03:45:45,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2024-10-11 03:45:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:45:45,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:45,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:45,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:45:45,858 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:45,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:45,858 INFO L85 PathProgramCache]: Analyzing trace with hash -873153248, now seen corresponding path program 1 times [2024-10-11 03:45:45,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599201178] [2024-10-11 03:45:45,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:45,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:46,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:46,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599201178] [2024-10-11 03:45:46,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599201178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:46,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:46,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:45:46,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585938010] [2024-10-11 03:45:46,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:46,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:45:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:46,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:45:46,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:45:46,038 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:46,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:46,353 INFO L93 Difference]: Finished difference Result 250 states and 322 transitions. [2024-10-11 03:45:46,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:45:46,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 03:45:46,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:46,355 INFO L225 Difference]: With dead ends: 250 [2024-10-11 03:45:46,355 INFO L226 Difference]: Without dead ends: 189 [2024-10-11 03:45:46,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:45:46,356 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 285 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:46,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 571 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:45:46,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-11 03:45:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 125. [2024-10-11 03:45:46,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 122 states have (on average 1.2377049180327868) internal successors, (151), 124 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2024-10-11 03:45:46,360 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 52 [2024-10-11 03:45:46,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:46,360 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2024-10-11 03:45:46,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:46,360 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2024-10-11 03:45:46,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 03:45:46,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:46,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:46,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:45:46,362 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:46,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:46,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1832778738, now seen corresponding path program 1 times [2024-10-11 03:45:46,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:46,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30746635] [2024-10-11 03:45:46,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:46,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:47,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:47,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30746635] [2024-10-11 03:45:47,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30746635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:47,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:47,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 03:45:47,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333775149] [2024-10-11 03:45:47,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:47,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:45:47,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:47,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:45:47,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:45:47,094 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:48,137 INFO L93 Difference]: Finished difference Result 307 states and 396 transitions. [2024-10-11 03:45:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:45:48,138 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 03:45:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:48,139 INFO L225 Difference]: With dead ends: 307 [2024-10-11 03:45:48,139 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 03:45:48,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 03:45:48,140 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 939 mSDsluCounter, 2083 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2343 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:48,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2343 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:45:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 03:45:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 125. [2024-10-11 03:45:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 122 states have (on average 1.2295081967213115) internal successors, (150), 124 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 150 transitions. [2024-10-11 03:45:48,144 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 150 transitions. Word has length 54 [2024-10-11 03:45:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:48,144 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 150 transitions. [2024-10-11 03:45:48,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 150 transitions. [2024-10-11 03:45:48,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 03:45:48,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:48,145 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:48,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:45:48,146 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:48,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:48,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1645932369, now seen corresponding path program 1 times [2024-10-11 03:45:48,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:48,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236487369] [2024-10-11 03:45:48,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:48,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:48,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:48,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236487369] [2024-10-11 03:45:48,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236487369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:48,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:48,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 03:45:48,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491983333] [2024-10-11 03:45:48,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:48,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:45:48,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:48,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:45:48,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:45:48,816 INFO L87 Difference]: Start difference. First operand 125 states and 150 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:49,704 INFO L93 Difference]: Finished difference Result 311 states and 402 transitions. [2024-10-11 03:45:49,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:45:49,704 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 03:45:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:49,705 INFO L225 Difference]: With dead ends: 311 [2024-10-11 03:45:49,705 INFO L226 Difference]: Without dead ends: 305 [2024-10-11 03:45:49,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2024-10-11 03:45:49,706 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 571 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 2556 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:49,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 2556 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:45:49,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-11 03:45:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 131. [2024-10-11 03:45:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 128 states have (on average 1.234375) internal successors, (158), 130 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 158 transitions. [2024-10-11 03:45:49,710 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 158 transitions. Word has length 54 [2024-10-11 03:45:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:49,711 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 158 transitions. [2024-10-11 03:45:49,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 158 transitions. [2024-10-11 03:45:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 03:45:49,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:49,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:49,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:45:49,712 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:49,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:49,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1729762893, now seen corresponding path program 1 times [2024-10-11 03:45:49,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:49,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662545940] [2024-10-11 03:45:49,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:50,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:50,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662545940] [2024-10-11 03:45:50,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662545940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:50,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:50,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:45:50,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294008595] [2024-10-11 03:45:50,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:50,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:45:50,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:50,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:45:50,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:45:50,199 INFO L87 Difference]: Start difference. First operand 131 states and 158 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:50,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:50,695 INFO L93 Difference]: Finished difference Result 287 states and 377 transitions. [2024-10-11 03:45:50,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:45:50,696 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-11 03:45:50,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:50,696 INFO L225 Difference]: With dead ends: 287 [2024-10-11 03:45:50,697 INFO L226 Difference]: Without dead ends: 281 [2024-10-11 03:45:50,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:45:50,697 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 684 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:50,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1266 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:45:50,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-11 03:45:50,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 119. [2024-10-11 03:45:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.2307692307692308) internal successors, (144), 118 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 144 transitions. [2024-10-11 03:45:50,701 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 144 transitions. Word has length 55 [2024-10-11 03:45:50,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:50,702 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 144 transitions. [2024-10-11 03:45:50,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 144 transitions. [2024-10-11 03:45:50,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 03:45:50,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:50,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:50,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:45:50,703 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:50,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:50,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1973185107, now seen corresponding path program 1 times [2024-10-11 03:45:50,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:50,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832700314] [2024-10-11 03:45:50,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:50,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:51,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:51,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832700314] [2024-10-11 03:45:51,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832700314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:51,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:51,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:45:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023954305] [2024-10-11 03:45:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:51,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:45:51,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:51,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:45:51,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:45:51,233 INFO L87 Difference]: Start difference. First operand 119 states and 144 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:51,563 INFO L93 Difference]: Finished difference Result 175 states and 222 transitions. [2024-10-11 03:45:51,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:45:51,564 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-11 03:45:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:51,565 INFO L225 Difference]: With dead ends: 175 [2024-10-11 03:45:51,565 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 03:45:51,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:45:51,566 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 414 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:51,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1109 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:45:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 03:45:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 101. [2024-10-11 03:45:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.25) internal successors, (125), 100 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2024-10-11 03:45:51,569 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 55 [2024-10-11 03:45:51,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:51,569 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2024-10-11 03:45:51,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:51,570 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2024-10-11 03:45:51,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 03:45:51,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:51,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:51,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:45:51,571 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:51,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:51,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1767402819, now seen corresponding path program 1 times [2024-10-11 03:45:51,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:51,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759527554] [2024-10-11 03:45:51,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:51,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:51,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759527554] [2024-10-11 03:45:51,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759527554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:51,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:51,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:45:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055992019] [2024-10-11 03:45:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:51,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:51,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:51,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:51,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:51,655 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:51,727 INFO L93 Difference]: Finished difference Result 359 states and 503 transitions. [2024-10-11 03:45:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:45:51,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-11 03:45:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:51,729 INFO L225 Difference]: With dead ends: 359 [2024-10-11 03:45:51,729 INFO L226 Difference]: Without dead ends: 316 [2024-10-11 03:45:51,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:45:51,730 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 479 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:51,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 597 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:45:51,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-11 03:45:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 142. [2024-10-11 03:45:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2024-10-11 03:45:51,735 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 72 [2024-10-11 03:45:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:51,735 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2024-10-11 03:45:51,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2024-10-11 03:45:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:45:51,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:51,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:51,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:45:51,737 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:51,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:51,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1330307651, now seen corresponding path program 1 times [2024-10-11 03:45:51,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:51,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111319037] [2024-10-11 03:45:51,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:51,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:51,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:51,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111319037] [2024-10-11 03:45:51,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111319037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:51,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:51,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:45:51,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197390181] [2024-10-11 03:45:51,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:51,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:51,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:51,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:51,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:51,823 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:51,876 INFO L93 Difference]: Finished difference Result 437 states and 615 transitions. [2024-10-11 03:45:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:51,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 03:45:51,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:51,878 INFO L225 Difference]: With dead ends: 437 [2024-10-11 03:45:51,878 INFO L226 Difference]: Without dead ends: 353 [2024-10-11 03:45:51,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:45:51,879 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 280 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:51,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 417 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:51,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-11 03:45:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 224. [2024-10-11 03:45:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.3721973094170403) internal successors, (306), 223 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 306 transitions. [2024-10-11 03:45:51,887 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 306 transitions. Word has length 74 [2024-10-11 03:45:51,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:51,887 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 306 transitions. [2024-10-11 03:45:51,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:51,887 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 306 transitions. [2024-10-11 03:45:51,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:45:51,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:51,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:51,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:45:51,888 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:51,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:51,889 INFO L85 PathProgramCache]: Analyzing trace with hash 794928439, now seen corresponding path program 1 times [2024-10-11 03:45:51,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:51,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369190791] [2024-10-11 03:45:51,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:51,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:51,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:51,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:51,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369190791] [2024-10-11 03:45:51,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369190791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:51,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:51,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:45:51,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91392891] [2024-10-11 03:45:51,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:51,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:51,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:51,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:51,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:51,994 INFO L87 Difference]: Start difference. First operand 224 states and 306 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:52,050 INFO L93 Difference]: Finished difference Result 519 states and 736 transitions. [2024-10-11 03:45:52,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:52,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 03:45:52,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:52,053 INFO L225 Difference]: With dead ends: 519 [2024-10-11 03:45:52,053 INFO L226 Difference]: Without dead ends: 435 [2024-10-11 03:45:52,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:45:52,054 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 290 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:52,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 428 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-10-11 03:45:52,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 347. [2024-10-11 03:45:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.407514450867052) internal successors, (487), 346 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 487 transitions. [2024-10-11 03:45:52,064 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 487 transitions. Word has length 74 [2024-10-11 03:45:52,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:52,064 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 487 transitions. [2024-10-11 03:45:52,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,064 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 487 transitions. [2024-10-11 03:45:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:45:52,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:52,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:52,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:45:52,066 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:52,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:52,066 INFO L85 PathProgramCache]: Analyzing trace with hash 670344324, now seen corresponding path program 1 times [2024-10-11 03:45:52,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:52,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588448424] [2024-10-11 03:45:52,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:52,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:52,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:52,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588448424] [2024-10-11 03:45:52,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588448424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:52,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:52,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:52,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630451645] [2024-10-11 03:45:52,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:52,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:52,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:52,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:52,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:52,117 INFO L87 Difference]: Start difference. First operand 347 states and 487 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:52,141 INFO L93 Difference]: Finished difference Result 638 states and 913 transitions. [2024-10-11 03:45:52,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:52,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 03:45:52,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:52,143 INFO L225 Difference]: With dead ends: 638 [2024-10-11 03:45:52,143 INFO L226 Difference]: Without dead ends: 349 [2024-10-11 03:45:52,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:52,144 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:52,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 198 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:52,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-11 03:45:52,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2024-10-11 03:45:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.3959537572254335) internal successors, (483), 346 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 483 transitions. [2024-10-11 03:45:52,151 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 483 transitions. Word has length 74 [2024-10-11 03:45:52,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:52,151 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 483 transitions. [2024-10-11 03:45:52,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,152 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 483 transitions. [2024-10-11 03:45:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:45:52,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:52,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:52,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:45:52,153 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:52,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:52,153 INFO L85 PathProgramCache]: Analyzing trace with hash -98948669, now seen corresponding path program 1 times [2024-10-11 03:45:52,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:52,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788754114] [2024-10-11 03:45:52,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:52,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:52,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:52,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788754114] [2024-10-11 03:45:52,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788754114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:52,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:52,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:52,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130239744] [2024-10-11 03:45:52,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:52,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:52,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:52,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:52,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:52,195 INFO L87 Difference]: Start difference. First operand 347 states and 483 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:52,217 INFO L93 Difference]: Finished difference Result 880 states and 1250 transitions. [2024-10-11 03:45:52,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:52,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 03:45:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:52,219 INFO L225 Difference]: With dead ends: 880 [2024-10-11 03:45:52,220 INFO L226 Difference]: Without dead ends: 591 [2024-10-11 03:45:52,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:52,221 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 50 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:52,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 281 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-11 03:45:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2024-10-11 03:45:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.3843537414965987) internal successors, (814), 588 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 814 transitions. [2024-10-11 03:45:52,234 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 814 transitions. Word has length 74 [2024-10-11 03:45:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:52,234 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 814 transitions. [2024-10-11 03:45:52,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 814 transitions. [2024-10-11 03:45:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:45:52,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:52,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:52,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:45:52,236 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:52,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:52,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2082611331, now seen corresponding path program 1 times [2024-10-11 03:45:52,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:52,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136686184] [2024-10-11 03:45:52,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:52,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:52,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:52,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136686184] [2024-10-11 03:45:52,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136686184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:52,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:52,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:45:52,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410335091] [2024-10-11 03:45:52,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:52,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:52,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:52,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:52,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:52,323 INFO L87 Difference]: Start difference. First operand 589 states and 814 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:52,379 INFO L93 Difference]: Finished difference Result 1050 states and 1466 transitions. [2024-10-11 03:45:52,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:52,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 03:45:52,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:52,382 INFO L225 Difference]: With dead ends: 1050 [2024-10-11 03:45:52,383 INFO L226 Difference]: Without dead ends: 897 [2024-10-11 03:45:52,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:45:52,384 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 284 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:52,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 451 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-10-11 03:45:52,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 740. [2024-10-11 03:45:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.3910690121786198) internal successors, (1028), 739 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1028 transitions. [2024-10-11 03:45:52,400 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1028 transitions. Word has length 74 [2024-10-11 03:45:52,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:52,400 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1028 transitions. [2024-10-11 03:45:52,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1028 transitions. [2024-10-11 03:45:52,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 03:45:52,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:52,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:52,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:45:52,402 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:52,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:52,402 INFO L85 PathProgramCache]: Analyzing trace with hash -753330043, now seen corresponding path program 1 times [2024-10-11 03:45:52,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:52,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241568416] [2024-10-11 03:45:52,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:52,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:52,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:52,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:52,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241568416] [2024-10-11 03:45:52,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241568416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:52,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:52,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:52,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305865170] [2024-10-11 03:45:52,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:52,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:52,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:52,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:52,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:52,483 INFO L87 Difference]: Start difference. First operand 740 states and 1028 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:52,504 INFO L93 Difference]: Finished difference Result 1861 states and 2599 transitions. [2024-10-11 03:45:52,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:52,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-11 03:45:52,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:52,508 INFO L225 Difference]: With dead ends: 1861 [2024-10-11 03:45:52,508 INFO L226 Difference]: Without dead ends: 1179 [2024-10-11 03:45:52,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:52,510 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 59 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:52,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 264 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:52,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2024-10-11 03:45:52,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1105. [2024-10-11 03:45:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1104 states have (on average 1.3804347826086956) internal successors, (1524), 1104 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1524 transitions. [2024-10-11 03:45:52,529 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1524 transitions. Word has length 75 [2024-10-11 03:45:52,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:52,529 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1524 transitions. [2024-10-11 03:45:52,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1524 transitions. [2024-10-11 03:45:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:45:52,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:52,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:52,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:45:52,531 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:52,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:52,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1764053275, now seen corresponding path program 1 times [2024-10-11 03:45:52,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:52,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084713709] [2024-10-11 03:45:52,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:52,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:52,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084713709] [2024-10-11 03:45:52,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084713709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:52,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:52,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:52,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151488326] [2024-10-11 03:45:52,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:52,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:52,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:52,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:52,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:52,610 INFO L87 Difference]: Start difference. First operand 1105 states and 1524 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:52,634 INFO L93 Difference]: Finished difference Result 3091 states and 4259 transitions. [2024-10-11 03:45:52,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:52,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-11 03:45:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:52,640 INFO L225 Difference]: With dead ends: 3091 [2024-10-11 03:45:52,641 INFO L226 Difference]: Without dead ends: 2044 [2024-10-11 03:45:52,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:52,657 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 52 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:52,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 263 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2024-10-11 03:45:52,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1934. [2024-10-11 03:45:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1934 states, 1933 states have (on average 1.362648732540093) internal successors, (2634), 1933 states have internal predecessors, (2634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2634 transitions. [2024-10-11 03:45:52,689 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2634 transitions. Word has length 76 [2024-10-11 03:45:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:52,690 INFO L471 AbstractCegarLoop]: Abstraction has 1934 states and 2634 transitions. [2024-10-11 03:45:52,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2634 transitions. [2024-10-11 03:45:52,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:45:52,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:52,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:52,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:45:52,691 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:52,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:52,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1616355032, now seen corresponding path program 1 times [2024-10-11 03:45:52,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:52,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839802416] [2024-10-11 03:45:52,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:52,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:52,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:52,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839802416] [2024-10-11 03:45:52,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839802416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:52,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:52,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:52,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031388096] [2024-10-11 03:45:52,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:52,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:52,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:52,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:52,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:52,771 INFO L87 Difference]: Start difference. First operand 1934 states and 2634 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:52,801 INFO L93 Difference]: Finished difference Result 5470 states and 7400 transitions. [2024-10-11 03:45:52,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:52,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-11 03:45:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:52,812 INFO L225 Difference]: With dead ends: 5470 [2024-10-11 03:45:52,813 INFO L226 Difference]: Without dead ends: 3594 [2024-10-11 03:45:52,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:52,816 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 42 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:52,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 261 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:52,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2024-10-11 03:45:52,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3376. [2024-10-11 03:45:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3376 states, 3375 states have (on average 1.3342222222222222) internal successors, (4503), 3375 states have internal predecessors, (4503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 4503 transitions. [2024-10-11 03:45:52,877 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 4503 transitions. Word has length 77 [2024-10-11 03:45:52,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:52,877 INFO L471 AbstractCegarLoop]: Abstraction has 3376 states and 4503 transitions. [2024-10-11 03:45:52,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 4503 transitions. [2024-10-11 03:45:52,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:45:52,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:52,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:52,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:45:52,879 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:52,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2121296140, now seen corresponding path program 1 times [2024-10-11 03:45:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:52,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374605538] [2024-10-11 03:45:52,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:52,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:53,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:53,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374605538] [2024-10-11 03:45:53,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374605538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:53,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:53,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:45:53,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756525156] [2024-10-11 03:45:53,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:53,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:45:53,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:53,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:45:53,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:45:53,072 INFO L87 Difference]: Start difference. First operand 3376 states and 4503 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:53,114 INFO L93 Difference]: Finished difference Result 3474 states and 4632 transitions. [2024-10-11 03:45:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:45:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-11 03:45:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:53,125 INFO L225 Difference]: With dead ends: 3474 [2024-10-11 03:45:53,125 INFO L226 Difference]: Without dead ends: 3472 [2024-10-11 03:45:53,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:45:53,127 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:53,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:53,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2024-10-11 03:45:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3472. [2024-10-11 03:45:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 3471 states have (on average 1.313454335926246) internal successors, (4559), 3471 states have internal predecessors, (4559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:53,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4559 transitions. [2024-10-11 03:45:53,190 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4559 transitions. Word has length 78 [2024-10-11 03:45:53,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:53,191 INFO L471 AbstractCegarLoop]: Abstraction has 3472 states and 4559 transitions. [2024-10-11 03:45:53,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:53,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4559 transitions. [2024-10-11 03:45:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:45:53,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:53,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:53,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:45:53,192 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:53,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:53,192 INFO L85 PathProgramCache]: Analyzing trace with hash 305590840, now seen corresponding path program 1 times [2024-10-11 03:45:53,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:53,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645422077] [2024-10-11 03:45:53,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:53,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:53,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645422077] [2024-10-11 03:45:53,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645422077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:53,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:53,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:53,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943242704] [2024-10-11 03:45:53,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:53,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:53,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:53,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:53,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:53,261 INFO L87 Difference]: Start difference. First operand 3472 states and 4559 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:53,300 INFO L93 Difference]: Finished difference Result 7020 states and 9233 transitions. [2024-10-11 03:45:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:53,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-11 03:45:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:53,311 INFO L225 Difference]: With dead ends: 7020 [2024-10-11 03:45:53,311 INFO L226 Difference]: Without dead ends: 3606 [2024-10-11 03:45:53,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:53,315 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:53,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 214 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2024-10-11 03:45:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 3604. [2024-10-11 03:45:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3604 states, 3603 states have (on average 1.2930890924229808) internal successors, (4659), 3603 states have internal predecessors, (4659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 4659 transitions. [2024-10-11 03:45:53,377 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 4659 transitions. Word has length 78 [2024-10-11 03:45:53,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:53,378 INFO L471 AbstractCegarLoop]: Abstraction has 3604 states and 4659 transitions. [2024-10-11 03:45:53,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:53,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 4659 transitions. [2024-10-11 03:45:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:45:53,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:53,380 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:53,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:45:53,380 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:53,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:53,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1123966569, now seen corresponding path program 1 times [2024-10-11 03:45:53,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:53,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767589784] [2024-10-11 03:45:53,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:53,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:53,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:53,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767589784] [2024-10-11 03:45:53,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767589784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:45:53,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911871512] [2024-10-11 03:45:53,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:53,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:45:53,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:45:53,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:45:53,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:45:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:53,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 03:45:53,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:45:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:54,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:45:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:55,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911871512] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:45:55,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:45:55,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2024-10-11 03:45:55,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626061147] [2024-10-11 03:45:55,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:45:55,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 03:45:55,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:55,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 03:45:55,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:45:55,933 INFO L87 Difference]: Start difference. First operand 3604 states and 4659 transitions. Second operand has 25 states, 25 states have (on average 10.04) internal successors, (251), 24 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:57,354 INFO L93 Difference]: Finished difference Result 18276 states and 23511 transitions. [2024-10-11 03:45:57,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-11 03:45:57,355 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.04) internal successors, (251), 24 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-11 03:45:57,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:57,389 INFO L225 Difference]: With dead ends: 18276 [2024-10-11 03:45:57,390 INFO L226 Difference]: Without dead ends: 14730 [2024-10-11 03:45:57,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=810, Invalid=2850, Unknown=0, NotChecked=0, Total=3660 [2024-10-11 03:45:57,401 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 2034 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:57,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2034 Valid, 972 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:45:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14730 states. [2024-10-11 03:45:57,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14730 to 7679. [2024-10-11 03:45:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7679 states, 7678 states have (on average 1.2862724667882262) internal successors, (9876), 7678 states have internal predecessors, (9876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:57,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7679 states to 7679 states and 9876 transitions. [2024-10-11 03:45:57,565 INFO L78 Accepts]: Start accepts. Automaton has 7679 states and 9876 transitions. Word has length 100 [2024-10-11 03:45:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:57,566 INFO L471 AbstractCegarLoop]: Abstraction has 7679 states and 9876 transitions. [2024-10-11 03:45:57,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.04) internal successors, (251), 24 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 7679 states and 9876 transitions. [2024-10-11 03:45:57,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:45:57,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:57,568 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:57,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:45:57,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 03:45:57,769 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:57,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:57,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1838876044, now seen corresponding path program 1 times [2024-10-11 03:45:57,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:57,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139067012] [2024-10-11 03:45:57,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:57,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 03:45:57,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:57,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139067012] [2024-10-11 03:45:57,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139067012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:57,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:57,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:57,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387218394] [2024-10-11 03:45:57,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:57,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:57,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:57,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:57,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:57,823 INFO L87 Difference]: Start difference. First operand 7679 states and 9876 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:57,886 INFO L93 Difference]: Finished difference Result 14657 states and 18939 transitions. [2024-10-11 03:45:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:57,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-11 03:45:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:57,895 INFO L225 Difference]: With dead ends: 14657 [2024-10-11 03:45:57,895 INFO L226 Difference]: Without dead ends: 7043 [2024-10-11 03:45:57,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:57,904 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 82 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:57,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 100 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7043 states. [2024-10-11 03:45:57,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7043 to 7043. [2024-10-11 03:45:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7043 states, 7042 states have (on average 1.2808861119000283) internal successors, (9020), 7042 states have internal predecessors, (9020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7043 states to 7043 states and 9020 transitions. [2024-10-11 03:45:57,989 INFO L78 Accepts]: Start accepts. Automaton has 7043 states and 9020 transitions. Word has length 101 [2024-10-11 03:45:57,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:57,989 INFO L471 AbstractCegarLoop]: Abstraction has 7043 states and 9020 transitions. [2024-10-11 03:45:57,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 7043 states and 9020 transitions. [2024-10-11 03:45:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:45:57,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:57,993 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:57,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:45:57,993 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:57,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:57,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1795834775, now seen corresponding path program 1 times [2024-10-11 03:45:57,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:57,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133276465] [2024-10-11 03:45:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:57,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:58,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:58,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133276465] [2024-10-11 03:45:58,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133276465] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:45:58,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751220445] [2024-10-11 03:45:58,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:58,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:45:58,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:45:58,396 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:45:58,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:45:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:58,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 03:45:58,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:45:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:45:58,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:45:58,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751220445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:58,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:45:58,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2024-10-11 03:45:58,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916586106] [2024-10-11 03:45:58,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:58,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:45:58,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:58,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:45:58,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:45:58,987 INFO L87 Difference]: Start difference. First operand 7043 states and 9020 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 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-11 03:45:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:59,353 INFO L93 Difference]: Finished difference Result 21025 states and 26950 transitions. [2024-10-11 03:45:59,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:45:59,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 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 101 [2024-10-11 03:45:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:59,377 INFO L225 Difference]: With dead ends: 21025 [2024-10-11 03:45:59,377 INFO L226 Difference]: Without dead ends: 14041 [2024-10-11 03:45:59,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:45:59,388 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 248 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:59,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 457 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:45:59,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14041 states. [2024-10-11 03:45:59,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14041 to 7043. [2024-10-11 03:45:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7043 states, 7042 states have (on average 1.2807441067878444) internal successors, (9019), 7042 states have internal predecessors, (9019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7043 states to 7043 states and 9019 transitions. [2024-10-11 03:45:59,502 INFO L78 Accepts]: Start accepts. Automaton has 7043 states and 9019 transitions. Word has length 101 [2024-10-11 03:45:59,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:59,503 INFO L471 AbstractCegarLoop]: Abstraction has 7043 states and 9019 transitions. [2024-10-11 03:45:59,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 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-11 03:45:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand 7043 states and 9019 transitions. [2024-10-11 03:45:59,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 03:45:59,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:59,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:59,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 03:45:59,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:45:59,710 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:59,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:59,710 INFO L85 PathProgramCache]: Analyzing trace with hash 446079846, now seen corresponding path program 1 times [2024-10-11 03:45:59,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:59,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554734711] [2024-10-11 03:45:59,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:59,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:00,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:00,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554734711] [2024-10-11 03:46:00,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554734711] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:46:00,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110407820] [2024-10-11 03:46:00,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:00,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:46:00,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:46:00,233 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:46:00,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:46:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:00,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 03:46:00,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:46:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 03:46:00,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:46:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 03:46:01,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110407820] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:46:01,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:46:01,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 8] total 23 [2024-10-11 03:46:01,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026478135] [2024-10-11 03:46:01,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:46:01,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:46:01,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:01,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:46:01,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:46:01,400 INFO L87 Difference]: Start difference. First operand 7043 states and 9019 transitions. Second operand has 23 states, 23 states have (on average 12.652173913043478) internal successors, (291), 23 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:12,336 INFO L93 Difference]: Finished difference Result 46993 states and 60903 transitions. [2024-10-11 03:46:12,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2024-10-11 03:46:12,337 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 12.652173913043478) internal successors, (291), 23 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-10-11 03:46:12,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:12,389 INFO L225 Difference]: With dead ends: 46993 [2024-10-11 03:46:12,390 INFO L226 Difference]: Without dead ends: 39951 [2024-10-11 03:46:12,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27029 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=6373, Invalid=58397, Unknown=0, NotChecked=0, Total=64770 [2024-10-11 03:46:12,413 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 2955 mSDsluCounter, 4124 mSDsCounter, 0 mSdLazyCounter, 9289 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2955 SdHoareTripleChecker+Valid, 4489 SdHoareTripleChecker+Invalid, 9371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 9289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:12,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2955 Valid, 4489 Invalid, 9371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 9289 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-11 03:46:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39951 states. [2024-10-11 03:46:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39951 to 28857. [2024-10-11 03:46:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28857 states, 28856 states have (on average 1.28524397005822) internal successors, (37087), 28856 states have internal predecessors, (37087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28857 states to 28857 states and 37087 transitions. [2024-10-11 03:46:12,846 INFO L78 Accepts]: Start accepts. Automaton has 28857 states and 37087 transitions. Word has length 102 [2024-10-11 03:46:12,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:12,846 INFO L471 AbstractCegarLoop]: Abstraction has 28857 states and 37087 transitions. [2024-10-11 03:46:12,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.652173913043478) internal successors, (291), 23 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 28857 states and 37087 transitions. [2024-10-11 03:46:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 03:46:12,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:12,850 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:46:12,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 03:46:13,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:46:13,052 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:13,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:13,052 INFO L85 PathProgramCache]: Analyzing trace with hash -621356928, now seen corresponding path program 1 times [2024-10-11 03:46:13,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:13,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15196956] [2024-10-11 03:46:13,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:13,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:13,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:13,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15196956] [2024-10-11 03:46:13,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15196956] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:46:13,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95257493] [2024-10-11 03:46:13,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:13,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:46:13,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:46:13,587 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:46:13,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:46:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:13,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 03:46:13,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:46:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:15,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:46:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:16,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95257493] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:46:16,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:46:16,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 40 [2024-10-11 03:46:16,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450011861] [2024-10-11 03:46:16,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:46:16,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-11 03:46:16,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:16,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-11 03:46:16,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1444, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 03:46:16,852 INFO L87 Difference]: Start difference. First operand 28857 states and 37087 transitions. Second operand has 40 states, 40 states have (on average 7.225) internal successors, (289), 40 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)