./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8903dcb91a7500453f98b743541ef164d589c2f5828e51ac11fb5ea90b79c3dd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:59:52,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:59:52,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:59:52,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:59:52,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:59:52,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:59:52,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:59:52,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:59:52,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:59:52,525 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:59:52,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:59:52,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:59:52,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:59:52,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:59:52,528 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:59:52,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:59:52,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:59:52,529 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:59:52,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:59:52,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:59:52,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:59:52,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:59:52,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:59:52,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:59:52,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:59:52,531 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:59:52,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:59:52,532 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:59:52,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:59:52,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:59:52,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:59:52,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:59:52,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:59:52,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:59:52,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:59:52,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:59:52,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:59:52,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:59:52,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:59:52,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:59:52,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:59:52,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:59:52,539 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8903dcb91a7500453f98b743541ef164d589c2f5828e51ac11fb5ea90b79c3dd [2024-11-08 15:59:52,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:59:52,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:59:52,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:59:52,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:59:52,849 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:59:52,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-11-08 15:59:54,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:59:54,542 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:59:54,543 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-11-08 15:59:54,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1dffe6d4/7c203f3f30da44f493572cf48c661385/FLAG60b3b7e92 [2024-11-08 15:59:54,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1dffe6d4/7c203f3f30da44f493572cf48c661385 [2024-11-08 15:59:54,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:59:54,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:59:54,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:59:54,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:59:54,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:59:54,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:59:54" (1/1) ... [2024-11-08 15:59:54,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7331a94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:54, skipping insertion in model container [2024-11-08 15:59:54,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:59:54" (1/1) ... [2024-11-08 15:59:54,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:59:54,872 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7543,7556] [2024-11-08 15:59:54,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10430,10443] [2024-11-08 15:59:54,904 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11521,11534] [2024-11-08 15:59:54,909 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12127,12140] [2024-11-08 15:59:54,916 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13546,13559] [2024-11-08 15:59:54,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14152,14165] [2024-11-08 15:59:54,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15123,15136] [2024-11-08 15:59:54,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:59:54,999 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:59:55,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7543,7556] [2024-11-08 15:59:55,047 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10430,10443] [2024-11-08 15:59:55,052 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11521,11534] [2024-11-08 15:59:55,055 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12127,12140] [2024-11-08 15:59:55,061 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13546,13559] [2024-11-08 15:59:55,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14152,14165] [2024-11-08 15:59:55,070 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15123,15136] [2024-11-08 15:59:55,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:59:55,127 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:59:55,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:55 WrapperNode [2024-11-08 15:59:55,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:59:55,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:59:55,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:59:55,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:59:55,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:55" (1/1) ... [2024-11-08 15:59:55,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:55" (1/1) ... [2024-11-08 15:59:55,212 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1104 [2024-11-08 15:59:55,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:59:55,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:59:55,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:59:55,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:59:55,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:55" (1/1) ... [2024-11-08 15:59:55,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:55" (1/1) ... [2024-11-08 15:59:55,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:55" (1/1) ... [2024-11-08 15:59:55,266 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:59:55,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:55" (1/1) ... [2024-11-08 15:59:55,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:55" (1/1) ... [2024-11-08 15:59:55,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:55" (1/1) ... [2024-11-08 15:59:55,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:55" (1/1) ... [2024-11-08 15:59:55,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:55" (1/1) ... [2024-11-08 15:59:55,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:55" (1/1) ... [2024-11-08 15:59:55,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:59:55,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:59:55,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:59:55,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:59:55,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:55" (1/1) ... [2024-11-08 15:59:55,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:59:55,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:59:55,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:59:55,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:59:55,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:59:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:59:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:59:55,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:59:55,689 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:59:55,691 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:59:56,452 INFO L? ?]: Removed 178 outVars from TransFormulas that were not future-live. [2024-11-08 15:59:56,452 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:59:56,475 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:59:56,476 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:59:56,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:59:56 BoogieIcfgContainer [2024-11-08 15:59:56,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:59:56,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:59:56,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:59:56,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:59:56,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:59:54" (1/3) ... [2024-11-08 15:59:56,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6c24a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:59:56, skipping insertion in model container [2024-11-08 15:59:56,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:55" (2/3) ... [2024-11-08 15:59:56,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6c24a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:59:56, skipping insertion in model container [2024-11-08 15:59:56,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:59:56" (3/3) ... [2024-11-08 15:59:56,487 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-11-08 15:59:56,504 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:59:56,505 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-08 15:59:56,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:59:56,579 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;@42cc32ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:59:56,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 15:59:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 199 states have (on average 1.8241206030150754) internal successors, (363), 206 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 15:59:56,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:56,596 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-11-08 15:59:56,597 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-11-08 15:59:56,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1485336045, now seen corresponding path program 1 times [2024-11-08 15:59:56,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:56,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836358506] [2024-11-08 15:59:56,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:56,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:57,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:57,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836358506] [2024-11-08 15:59:57,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836358506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:57,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:57,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:59:57,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088657989] [2024-11-08 15:59:57,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:57,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:59:57,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:57,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:59:57,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:59:57,273 INFO L87 Difference]: Start difference. First operand has 207 states, 199 states have (on average 1.8241206030150754) internal successors, (363), 206 states have internal predecessors, (363), 0 states have call successors, (0), 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.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-11-08 15:59:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:57,509 INFO L93 Difference]: Finished difference Result 339 states and 570 transitions. [2024-11-08 15:59:57,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:59:57,512 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-11-08 15:59:57,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:57,520 INFO L225 Difference]: With dead ends: 339 [2024-11-08 15:59:57,521 INFO L226 Difference]: Without dead ends: 175 [2024-11-08 15:59:57,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:59:57,527 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 851 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:57,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 224 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:59:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-08 15:59:57,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2024-11-08 15:59:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 168 states have (on average 1.2857142857142858) internal successors, (216), 174 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2024-11-08 15:59:57,579 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 47 [2024-11-08 15:59:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:57,583 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2024-11-08 15:59:57,583 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-11-08 15:59:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2024-11-08 15:59:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 15:59:57,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:57,585 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-11-08 15:59:57,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:59:57,585 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-11-08 15:59:57,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:57,586 INFO L85 PathProgramCache]: Analyzing trace with hash 200422799, now seen corresponding path program 1 times [2024-11-08 15:59:57,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:57,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682407566] [2024-11-08 15:59:57,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:57,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:57,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:57,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682407566] [2024-11-08 15:59:57,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682407566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:57,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:57,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:59:57,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584928221] [2024-11-08 15:59:57,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:57,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:59:57,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:57,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:59:57,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:59:57,763 INFO L87 Difference]: Start difference. First operand 175 states and 216 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-11-08 15:59:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:57,900 INFO L93 Difference]: Finished difference Result 298 states and 377 transitions. [2024-11-08 15:59:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:59:57,900 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-11-08 15:59:57,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:57,902 INFO L225 Difference]: With dead ends: 298 [2024-11-08 15:59:57,902 INFO L226 Difference]: Without dead ends: 162 [2024-11-08 15:59:57,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:59:57,904 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 557 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:57,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 131 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:59:57,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-08 15:59:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-08 15:59:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 155 states have (on average 1.2903225806451613) internal successors, (200), 161 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2024-11-08 15:59:57,920 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 200 transitions. Word has length 48 [2024-11-08 15:59:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:57,920 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-11-08 15:59:57,920 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-11-08 15:59:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 200 transitions. [2024-11-08 15:59:57,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 15:59:57,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:57,924 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-11-08 15:59:57,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:59:57,924 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-11-08 15:59:57,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:57,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2021523794, now seen corresponding path program 1 times [2024-11-08 15:59:57,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:57,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247257565] [2024-11-08 15:59:57,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:57,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:58,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:58,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247257565] [2024-11-08 15:59:58,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247257565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:58,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:58,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:59:58,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881665263] [2024-11-08 15:59:58,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:58,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:59:58,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:58,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:59:58,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:59:58,049 INFO L87 Difference]: Start difference. First operand 162 states and 200 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:58,197 INFO L93 Difference]: Finished difference Result 285 states and 360 transitions. [2024-11-08 15:59:58,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:59:58,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-08 15:59:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:58,200 INFO L225 Difference]: With dead ends: 285 [2024-11-08 15:59:58,200 INFO L226 Difference]: Without dead ends: 157 [2024-11-08 15:59:58,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:59:58,201 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 523 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:58,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 128 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:59:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-08 15:59:58,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-11-08 15:59:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 150 states have (on average 1.2866666666666666) internal successors, (193), 156 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 193 transitions. [2024-11-08 15:59:58,216 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 193 transitions. Word has length 49 [2024-11-08 15:59:58,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:58,216 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 193 transitions. [2024-11-08 15:59:58,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2024-11-08 15:59:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 15:59:58,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:58,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:59:58,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:59:58,219 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-11-08 15:59:58,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:58,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1243075504, now seen corresponding path program 1 times [2024-11-08 15:59:58,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:58,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261847241] [2024-11-08 15:59:58,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:58,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:58,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:58,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261847241] [2024-11-08 15:59:58,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261847241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:58,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:58,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:59:58,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836064791] [2024-11-08 15:59:58,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:58,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:59:58,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:58,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:59:58,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:59:58,704 INFO L87 Difference]: Start difference. First operand 157 states and 193 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:59,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:59,076 INFO L93 Difference]: Finished difference Result 244 states and 303 transitions. [2024-11-08 15:59:59,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:59:59,077 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-08 15:59:59,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:59,078 INFO L225 Difference]: With dead ends: 244 [2024-11-08 15:59:59,078 INFO L226 Difference]: Without dead ends: 239 [2024-11-08 15:59:59,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:59:59,080 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 860 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:59,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 484 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:59:59,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-08 15:59:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 157. [2024-11-08 15:59:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 150 states have (on average 1.28) internal successors, (192), 156 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-11-08 15:59:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 192 transitions. [2024-11-08 15:59:59,088 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 192 transitions. Word has length 50 [2024-11-08 15:59:59,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:59,088 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 192 transitions. [2024-11-08 15:59:59,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:59,089 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 192 transitions. [2024-11-08 15:59:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 15:59:59,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:59,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:59:59,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:59:59,091 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-11-08 15:59:59,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1139694690, now seen corresponding path program 1 times [2024-11-08 15:59:59,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:59,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618372708] [2024-11-08 15:59:59,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:59,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:59,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:59,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618372708] [2024-11-08 15:59:59,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618372708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:59,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:59,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:59:59,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738471608] [2024-11-08 15:59:59,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:59,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:59:59,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:59,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:59:59,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:59:59,414 INFO L87 Difference]: Start difference. First operand 157 states and 192 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:59,827 INFO L93 Difference]: Finished difference Result 303 states and 386 transitions. [2024-11-08 15:59:59,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:59:59,828 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-08 15:59:59,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:59,829 INFO L225 Difference]: With dead ends: 303 [2024-11-08 15:59:59,829 INFO L226 Difference]: Without dead ends: 243 [2024-11-08 15:59:59,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:59:59,831 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 880 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:59,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 624 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:59:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-08 15:59:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 157. [2024-11-08 15:59:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 156 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-11-08 15:59:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2024-11-08 15:59:59,838 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 50 [2024-11-08 15:59:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:59,838 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2024-11-08 15:59:59,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2024-11-08 15:59:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 15:59:59,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:59,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:59:59,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:59:59,840 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-11-08 15:59:59,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:59,844 INFO L85 PathProgramCache]: Analyzing trace with hash 134088220, now seen corresponding path program 1 times [2024-11-08 15:59:59,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:59,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192820722] [2024-11-08 15:59:59,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:59,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:00,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:00,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192820722] [2024-11-08 16:00:00,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192820722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:00,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:00,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:00:00,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223216977] [2024-11-08 16:00:00,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:00,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:00:00,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:00,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:00:00,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:00:00,139 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:00,422 INFO L93 Difference]: Finished difference Result 312 states and 389 transitions. [2024-11-08 16:00:00,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:00:00,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-08 16:00:00,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:00,424 INFO L225 Difference]: With dead ends: 312 [2024-11-08 16:00:00,424 INFO L226 Difference]: Without dead ends: 229 [2024-11-08 16:00:00,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:00:00,425 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 964 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:00,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 389 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:00:00,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-08 16:00:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 157. [2024-11-08 16:00:00,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 156 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-11-08 16:00:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 190 transitions. [2024-11-08 16:00:00,444 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 190 transitions. Word has length 50 [2024-11-08 16:00:00,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:00,444 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 190 transitions. [2024-11-08 16:00:00,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 190 transitions. [2024-11-08 16:00:00,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 16:00:00,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:00,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:00,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:00:00,450 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-11-08 16:00:00,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1263855603, now seen corresponding path program 1 times [2024-11-08 16:00:00,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:00,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372361815] [2024-11-08 16:00:00,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:00,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:01,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:01,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372361815] [2024-11-08 16:00:01,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372361815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:01,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:01,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 16:00:01,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878459250] [2024-11-08 16:00:01,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:01,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 16:00:01,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:01,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 16:00:01,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:00:01,502 INFO L87 Difference]: Start difference. First operand 157 states and 190 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:03,041 INFO L93 Difference]: Finished difference Result 436 states and 556 transitions. [2024-11-08 16:00:03,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 16:00:03,041 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-08 16:00:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:03,043 INFO L225 Difference]: With dead ends: 436 [2024-11-08 16:00:03,043 INFO L226 Difference]: Without dead ends: 389 [2024-11-08 16:00:03,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 16:00:03,045 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1549 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:03,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 2287 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:00:03,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-08 16:00:03,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 163. [2024-11-08 16:00:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:03,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2024-11-08 16:00:03,051 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 52 [2024-11-08 16:00:03,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:03,052 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2024-11-08 16:00:03,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:03,052 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2024-11-08 16:00:03,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 16:00:03,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:03,053 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-11-08 16:00:03,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:00:03,054 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-11-08 16:00:03,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:03,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1250594545, now seen corresponding path program 1 times [2024-11-08 16:00:03,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:03,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212743816] [2024-11-08 16:00:03,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:03,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:03,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:03,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212743816] [2024-11-08 16:00:03,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212743816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:03,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:03,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 16:00:03,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186596504] [2024-11-08 16:00:03,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:03,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 16:00:03,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:03,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 16:00:03,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:00:03,986 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:05,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:05,607 INFO L93 Difference]: Finished difference Result 389 states and 488 transitions. [2024-11-08 16:00:05,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 16:00:05,608 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-08 16:00:05,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:05,609 INFO L225 Difference]: With dead ends: 389 [2024-11-08 16:00:05,609 INFO L226 Difference]: Without dead ends: 383 [2024-11-08 16:00:05,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=285, Invalid=975, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 16:00:05,613 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1522 mSDsluCounter, 2421 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:05,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 2612 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:00:05,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-08 16:00:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 163. [2024-11-08 16:00:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.2628205128205128) internal successors, (197), 162 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 197 transitions. [2024-11-08 16:00:05,621 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 197 transitions. Word has length 52 [2024-11-08 16:00:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:05,621 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 197 transitions. [2024-11-08 16:00:05,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 197 transitions. [2024-11-08 16:00:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 16:00:05,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:05,623 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-11-08 16:00:05,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:00:05,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-08 16:00:05,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:05,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1783814727, now seen corresponding path program 1 times [2024-11-08 16:00:05,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:05,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022905844] [2024-11-08 16:00:05,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:05,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:06,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:06,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022905844] [2024-11-08 16:00:06,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022905844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:06,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:06,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:00:06,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937931256] [2024-11-08 16:00:06,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:06,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:00:06,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:06,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:00:06,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:00:06,115 INFO L87 Difference]: Start difference. First operand 163 states and 197 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:06,707 INFO L93 Difference]: Finished difference Result 290 states and 370 transitions. [2024-11-08 16:00:06,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:00:06,708 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-08 16:00:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:06,709 INFO L225 Difference]: With dead ends: 290 [2024-11-08 16:00:06,709 INFO L226 Difference]: Without dead ends: 236 [2024-11-08 16:00:06,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-08 16:00:06,710 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 827 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:06,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1545 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:00:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-08 16:00:06,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 152. [2024-11-08 16:00:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 146 states have (on average 1.2671232876712328) internal successors, (185), 151 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-11-08 16:00:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 185 transitions. [2024-11-08 16:00:06,717 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 185 transitions. Word has length 52 [2024-11-08 16:00:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:06,717 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 185 transitions. [2024-11-08 16:00:06,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 185 transitions. [2024-11-08 16:00:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 16:00:06,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:06,718 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-11-08 16:00:06,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:00:06,719 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-11-08 16:00:06,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1706910886, now seen corresponding path program 1 times [2024-11-08 16:00:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:06,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617652787] [2024-11-08 16:00:06,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:06,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:07,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:07,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617652787] [2024-11-08 16:00:07,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617652787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:07,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:07,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:00:07,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963531238] [2024-11-08 16:00:07,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:07,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:00:07,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:07,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:00:07,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:00:07,182 INFO L87 Difference]: Start difference. First operand 152 states and 185 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:07,750 INFO L93 Difference]: Finished difference Result 222 states and 276 transitions. [2024-11-08 16:00:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:00:07,750 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-08 16:00:07,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:07,751 INFO L225 Difference]: With dead ends: 222 [2024-11-08 16:00:07,751 INFO L226 Difference]: Without dead ends: 218 [2024-11-08 16:00:07,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-08 16:00:07,752 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 817 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:07,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1030 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:00:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-08 16:00:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 148. [2024-11-08 16:00:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.2657342657342658) internal successors, (181), 147 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 181 transitions. [2024-11-08 16:00:07,757 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 181 transitions. Word has length 52 [2024-11-08 16:00:07,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:07,758 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 181 transitions. [2024-11-08 16:00:07,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 181 transitions. [2024-11-08 16:00:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 16:00:07,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:07,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:07,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:00:07,760 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-08 16:00:07,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:07,761 INFO L85 PathProgramCache]: Analyzing trace with hash 190692674, now seen corresponding path program 1 times [2024-11-08 16:00:07,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:07,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876491575] [2024-11-08 16:00:07,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:07,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:07,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:07,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876491575] [2024-11-08 16:00:07,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876491575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:07,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:07,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:00:07,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866582962] [2024-11-08 16:00:07,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:07,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:00:07,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:07,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:00:07,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:00:07,969 INFO L87 Difference]: Start difference. First operand 148 states and 181 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:08,276 INFO L93 Difference]: Finished difference Result 227 states and 280 transitions. [2024-11-08 16:00:08,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:00:08,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-08 16:00:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:08,277 INFO L225 Difference]: With dead ends: 227 [2024-11-08 16:00:08,277 INFO L226 Difference]: Without dead ends: 220 [2024-11-08 16:00:08,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:00:08,278 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 444 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:08,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 451 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:00:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-08 16:00:08,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 148. [2024-11-08 16:00:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.2517482517482517) internal successors, (179), 147 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:08,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 179 transitions. [2024-11-08 16:00:08,284 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 179 transitions. Word has length 53 [2024-11-08 16:00:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:08,284 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 179 transitions. [2024-11-08 16:00:08,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 179 transitions. [2024-11-08 16:00:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 16:00:08,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:08,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:08,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:00:08,286 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-08 16:00:08,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:08,286 INFO L85 PathProgramCache]: Analyzing trace with hash -185701506, now seen corresponding path program 1 times [2024-11-08 16:00:08,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:08,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965424058] [2024-11-08 16:00:08,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:08,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:08,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:08,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965424058] [2024-11-08 16:00:08,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965424058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:08,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:08,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 16:00:08,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699137839] [2024-11-08 16:00:08,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:08,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 16:00:08,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:08,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 16:00:08,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:00:08,803 INFO L87 Difference]: Start difference. First operand 148 states and 179 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:09,579 INFO L93 Difference]: Finished difference Result 403 states and 523 transitions. [2024-11-08 16:00:09,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 16:00:09,580 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-08 16:00:09,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:09,581 INFO L225 Difference]: With dead ends: 403 [2024-11-08 16:00:09,581 INFO L226 Difference]: Without dead ends: 356 [2024-11-08 16:00:09,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2024-11-08 16:00:09,582 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 909 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:09,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1638 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:00:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-08 16:00:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 138. [2024-11-08 16:00:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 134 states have (on average 1.2462686567164178) internal successors, (167), 137 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 167 transitions. [2024-11-08 16:00:09,587 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 167 transitions. Word has length 53 [2024-11-08 16:00:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:09,587 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 167 transitions. [2024-11-08 16:00:09,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 167 transitions. [2024-11-08 16:00:09,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 16:00:09,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:09,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:09,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:00:09,588 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-11-08 16:00:09,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash -659119293, now seen corresponding path program 1 times [2024-11-08 16:00:09,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:09,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219017] [2024-11-08 16:00:09,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:09,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:09,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:09,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219017] [2024-11-08 16:00:09,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:09,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:09,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:00:09,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249540562] [2024-11-08 16:00:09,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:09,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:00:09,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:09,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:00:09,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:00:09,833 INFO L87 Difference]: Start difference. First operand 138 states and 167 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:10,170 INFO L93 Difference]: Finished difference Result 223 states and 273 transitions. [2024-11-08 16:00:10,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:00:10,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-08 16:00:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:10,172 INFO L225 Difference]: With dead ends: 223 [2024-11-08 16:00:10,172 INFO L226 Difference]: Without dead ends: 216 [2024-11-08 16:00:10,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:00:10,173 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 594 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:10,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 583 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:00:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-08 16:00:10,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 138. [2024-11-08 16:00:10,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 134 states have (on average 1.2388059701492538) internal successors, (166), 137 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2024-11-08 16:00:10,177 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 53 [2024-11-08 16:00:10,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:10,177 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2024-11-08 16:00:10,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:10,177 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2024-11-08 16:00:10,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 16:00:10,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:10,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:10,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:00:10,179 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-11-08 16:00:10,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:10,179 INFO L85 PathProgramCache]: Analyzing trace with hash 339917441, now seen corresponding path program 1 times [2024-11-08 16:00:10,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:10,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123999078] [2024-11-08 16:00:10,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:10,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:10,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:10,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123999078] [2024-11-08 16:00:10,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123999078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:10,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:10,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:00:10,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884670513] [2024-11-08 16:00:10,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:10,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:00:10,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:10,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:00:10,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:00:10,385 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:10,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:10,736 INFO L93 Difference]: Finished difference Result 281 states and 356 transitions. [2024-11-08 16:00:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:00:10,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-08 16:00:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:10,738 INFO L225 Difference]: With dead ends: 281 [2024-11-08 16:00:10,738 INFO L226 Difference]: Without dead ends: 220 [2024-11-08 16:00:10,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:00:10,739 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 341 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:10,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 661 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:00:10,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-08 16:00:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 138. [2024-11-08 16:00:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 134 states have (on average 1.2313432835820894) internal successors, (165), 137 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-11-08 16:00:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2024-11-08 16:00:10,742 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 53 [2024-11-08 16:00:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:10,742 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2024-11-08 16:00:10,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:10,743 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2024-11-08 16:00:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 16:00:10,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:10,743 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-11-08 16:00:10,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 16:00:10,744 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-08 16:00:10,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:10,744 INFO L85 PathProgramCache]: Analyzing trace with hash -11876974, now seen corresponding path program 1 times [2024-11-08 16:00:10,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:10,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066415159] [2024-11-08 16:00:10,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:10,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:11,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:11,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066415159] [2024-11-08 16:00:11,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066415159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:11,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:11,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:00:11,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359166731] [2024-11-08 16:00:11,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:11,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:00:11,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:11,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:00:11,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:00:11,123 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:11,499 INFO L93 Difference]: Finished difference Result 334 states and 423 transitions. [2024-11-08 16:00:11,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:00:11,500 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-08 16:00:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:11,501 INFO L225 Difference]: With dead ends: 334 [2024-11-08 16:00:11,502 INFO L226 Difference]: Without dead ends: 316 [2024-11-08 16:00:11,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:00:11,503 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 717 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:11,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 955 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:00:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-08 16:00:11,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 120. [2024-11-08 16:00:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 117 states have (on average 1.2393162393162394) internal successors, (145), 119 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 145 transitions. [2024-11-08 16:00:11,506 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 145 transitions. Word has length 55 [2024-11-08 16:00:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:11,507 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 145 transitions. [2024-11-08 16:00:11,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:11,507 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 145 transitions. [2024-11-08 16:00:11,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 16:00:11,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:11,508 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-11-08 16:00:11,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 16:00:11,508 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-11-08 16:00:11,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:11,508 INFO L85 PathProgramCache]: Analyzing trace with hash -637393645, now seen corresponding path program 1 times [2024-11-08 16:00:11,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:11,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882198002] [2024-11-08 16:00:11,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:11,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:12,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:12,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882198002] [2024-11-08 16:00:12,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882198002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:12,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:12,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 16:00:12,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635810237] [2024-11-08 16:00:12,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:12,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 16:00:12,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:12,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 16:00:12,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:00:12,186 INFO L87 Difference]: Start difference. First operand 120 states and 145 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:13,182 INFO L93 Difference]: Finished difference Result 328 states and 417 transitions. [2024-11-08 16:00:13,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 16:00:13,182 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-08 16:00:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:13,183 INFO L225 Difference]: With dead ends: 328 [2024-11-08 16:00:13,183 INFO L226 Difference]: Without dead ends: 320 [2024-11-08 16:00:13,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=911, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 16:00:13,185 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 766 mSDsluCounter, 2617 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 2875 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:13,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 2875 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:00:13,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-08 16:00:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 129. [2024-11-08 16:00:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 126 states have (on average 1.2380952380952381) internal successors, (156), 128 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 156 transitions. [2024-11-08 16:00:13,189 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 156 transitions. Word has length 55 [2024-11-08 16:00:13,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:13,189 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 156 transitions. [2024-11-08 16:00:13,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 156 transitions. [2024-11-08 16:00:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 16:00:13,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:13,190 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-11-08 16:00:13,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 16:00:13,191 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-08 16:00:13,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:13,191 INFO L85 PathProgramCache]: Analyzing trace with hash -824240014, now seen corresponding path program 1 times [2024-11-08 16:00:13,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:13,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365694910] [2024-11-08 16:00:13,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:13,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:13,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:13,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365694910] [2024-11-08 16:00:13,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365694910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:13,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:13,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 16:00:13,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852401350] [2024-11-08 16:00:13,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:13,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 16:00:13,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:13,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 16:00:13,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:00:13,810 INFO L87 Difference]: Start difference. First operand 129 states and 156 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:14,668 INFO L93 Difference]: Finished difference Result 332 states and 423 transitions. [2024-11-08 16:00:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 16:00:14,668 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-08 16:00:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:14,670 INFO L225 Difference]: With dead ends: 332 [2024-11-08 16:00:14,670 INFO L226 Difference]: Without dead ends: 326 [2024-11-08 16:00:14,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2024-11-08 16:00:14,671 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 698 mSDsluCounter, 2088 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:14,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 2327 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:00:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-08 16:00:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 135. [2024-11-08 16:00:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 132 states have (on average 1.2424242424242424) internal successors, (164), 134 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2024-11-08 16:00:14,681 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 55 [2024-11-08 16:00:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:14,682 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2024-11-08 16:00:14,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2024-11-08 16:00:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 16:00:14,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:14,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:14,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 16:00:14,683 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-08 16:00:14,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash -808849069, now seen corresponding path program 1 times [2024-11-08 16:00:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:14,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513235034] [2024-11-08 16:00:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:15,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:15,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513235034] [2024-11-08 16:00:15,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513235034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:15,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:15,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:00:15,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478337444] [2024-11-08 16:00:15,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:15,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:00:15,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:15,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:00:15,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:00:15,066 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:15,471 INFO L93 Difference]: Finished difference Result 197 states and 248 transitions. [2024-11-08 16:00:15,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:00:15,472 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-08 16:00:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:15,473 INFO L225 Difference]: With dead ends: 197 [2024-11-08 16:00:15,473 INFO L226 Difference]: Without dead ends: 182 [2024-11-08 16:00:15,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-08 16:00:15,474 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 503 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:15,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1055 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:00:15,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-08 16:00:15,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2024-11-08 16:00:15,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 118 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2024-11-08 16:00:15,478 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 56 [2024-11-08 16:00:15,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:15,478 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2024-11-08 16:00:15,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2024-11-08 16:00:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 16:00:15,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:15,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:15,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 16:00:15,479 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-08 16:00:15,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:15,479 INFO L85 PathProgramCache]: Analyzing trace with hash -995695438, now seen corresponding path program 1 times [2024-11-08 16:00:15,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:15,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117492563] [2024-11-08 16:00:15,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:15,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:15,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:15,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117492563] [2024-11-08 16:00:15,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117492563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:15,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:15,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:00:15,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331397105] [2024-11-08 16:00:15,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:15,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:00:15,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:15,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:00:15,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:00:15,891 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:16,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:16,273 INFO L93 Difference]: Finished difference Result 175 states and 225 transitions. [2024-11-08 16:00:16,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:00:16,275 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-08 16:00:16,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:16,275 INFO L225 Difference]: With dead ends: 175 [2024-11-08 16:00:16,275 INFO L226 Difference]: Without dead ends: 169 [2024-11-08 16:00:16,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-08 16:00:16,276 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 551 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:16,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 868 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:00:16,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-08 16:00:16,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 102. [2024-11-08 16:00:16,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.2475247524752475) internal successors, (126), 101 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2024-11-08 16:00:16,279 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 56 [2024-11-08 16:00:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:16,279 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2024-11-08 16:00:16,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2024-11-08 16:00:16,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-08 16:00:16,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:16,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:16,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 16:00:16,280 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-11-08 16:00:16,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:16,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2042294308, now seen corresponding path program 1 times [2024-11-08 16:00:16,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:16,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932974374] [2024-11-08 16:00:16,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:16,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:16,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:16,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932974374] [2024-11-08 16:00:16,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932974374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:16,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:16,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:00:16,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595583441] [2024-11-08 16:00:16,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:16,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:00:16,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:16,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:00:16,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:00:16,369 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:16,441 INFO L93 Difference]: Finished difference Result 360 states and 504 transitions. [2024-11-08 16:00:16,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:00:16,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-08 16:00:16,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:16,443 INFO L225 Difference]: With dead ends: 360 [2024-11-08 16:00:16,443 INFO L226 Difference]: Without dead ends: 317 [2024-11-08 16:00:16,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:00:16,444 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 479 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:16,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 599 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:00:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-08 16:00:16,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 143. [2024-11-08 16:00:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 186 transitions. [2024-11-08 16:00:16,449 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 186 transitions. Word has length 73 [2024-11-08 16:00:16,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:16,449 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 186 transitions. [2024-11-08 16:00:16,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2024-11-08 16:00:16,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 16:00:16,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:16,450 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-11-08 16:00:16,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 16:00:16,451 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-11-08 16:00:16,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:16,451 INFO L85 PathProgramCache]: Analyzing trace with hash -786943772, now seen corresponding path program 1 times [2024-11-08 16:00:16,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:16,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207727886] [2024-11-08 16:00:16,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:16,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:16,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:16,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207727886] [2024-11-08 16:00:16,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207727886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:16,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:16,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:00:16,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52458127] [2024-11-08 16:00:16,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:16,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:00:16,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:16,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:00:16,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:00:16,536 INFO L87 Difference]: Start difference. First operand 143 states and 186 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:16,590 INFO L93 Difference]: Finished difference Result 438 states and 616 transitions. [2024-11-08 16:00:16,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:00:16,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-08 16:00:16,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:16,592 INFO L225 Difference]: With dead ends: 438 [2024-11-08 16:00:16,592 INFO L226 Difference]: Without dead ends: 354 [2024-11-08 16:00:16,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:00:16,593 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 279 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:16,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 433 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:00:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-08 16:00:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 225. [2024-11-08 16:00:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.3705357142857142) internal successors, (307), 224 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:16,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 307 transitions. [2024-11-08 16:00:16,602 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 307 transitions. Word has length 75 [2024-11-08 16:00:16,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:16,602 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 307 transitions. [2024-11-08 16:00:16,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 307 transitions. [2024-11-08 16:00:16,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 16:00:16,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:16,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:16,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 16:00:16,604 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-11-08 16:00:16,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1322322984, now seen corresponding path program 1 times [2024-11-08 16:00:16,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:16,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637409762] [2024-11-08 16:00:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:16,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:16,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:16,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637409762] [2024-11-08 16:00:16,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637409762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:16,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:16,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:00:16,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709580377] [2024-11-08 16:00:16,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:16,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:00:16,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:16,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:00:16,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:00:16,688 INFO L87 Difference]: Start difference. First operand 225 states and 307 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:16,741 INFO L93 Difference]: Finished difference Result 520 states and 737 transitions. [2024-11-08 16:00:16,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:00:16,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-08 16:00:16,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:16,745 INFO L225 Difference]: With dead ends: 520 [2024-11-08 16:00:16,745 INFO L226 Difference]: Without dead ends: 436 [2024-11-08 16:00:16,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:00:16,746 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 290 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:16,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 430 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:00:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-08 16:00:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 348. [2024-11-08 16:00:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.4063400576368876) internal successors, (488), 347 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 488 transitions. [2024-11-08 16:00:16,755 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 488 transitions. Word has length 75 [2024-11-08 16:00:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:16,756 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 488 transitions. [2024-11-08 16:00:16,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 488 transitions. [2024-11-08 16:00:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 16:00:16,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:16,757 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-11-08 16:00:16,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 16:00:16,757 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-11-08 16:00:16,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:16,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1446907099, now seen corresponding path program 1 times [2024-11-08 16:00:16,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:16,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297715297] [2024-11-08 16:00:16,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:16,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:16,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:16,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297715297] [2024-11-08 16:00:16,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297715297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:16,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:16,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:00:16,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871394222] [2024-11-08 16:00:16,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:16,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:00:16,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:16,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:00:16,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:00:16,808 INFO L87 Difference]: Start difference. First operand 348 states and 488 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-11-08 16:00:16,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:16,833 INFO L93 Difference]: Finished difference Result 639 states and 914 transitions. [2024-11-08 16:00:16,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:00:16,833 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-11-08 16:00:16,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:16,834 INFO L225 Difference]: With dead ends: 639 [2024-11-08 16:00:16,835 INFO L226 Difference]: Without dead ends: 350 [2024-11-08 16:00:16,835 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-11-08 16:00:16,835 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 50 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:16,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 200 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:00:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-08 16:00:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2024-11-08 16:00:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.3948126801152738) internal successors, (484), 347 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 484 transitions. [2024-11-08 16:00:16,842 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 484 transitions. Word has length 75 [2024-11-08 16:00:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:16,842 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 484 transitions. [2024-11-08 16:00:16,842 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-11-08 16:00:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 484 transitions. [2024-11-08 16:00:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 16:00:16,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:16,843 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-11-08 16:00:16,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 16:00:16,844 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-11-08 16:00:16,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2078767204, now seen corresponding path program 1 times [2024-11-08 16:00:16,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:16,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561411493] [2024-11-08 16:00:16,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:16,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:16,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:16,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561411493] [2024-11-08 16:00:16,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561411493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:16,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:16,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:00:16,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833514605] [2024-11-08 16:00:16,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:16,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:00:16,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:16,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:00:16,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:00:16,905 INFO L87 Difference]: Start difference. First operand 348 states and 484 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-11-08 16:00:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:16,928 INFO L93 Difference]: Finished difference Result 881 states and 1251 transitions. [2024-11-08 16:00:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:00:16,928 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-11-08 16:00:16,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:16,930 INFO L225 Difference]: With dead ends: 881 [2024-11-08 16:00:16,930 INFO L226 Difference]: Without dead ends: 592 [2024-11-08 16:00:16,931 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-11-08 16:00:16,932 INFO L432 NwaCegarLoop]: 172 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, 283 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-11-08 16:00:16,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 283 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:00:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-08 16:00:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 590. [2024-11-08 16:00:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.3837011884550086) internal successors, (815), 589 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 815 transitions. [2024-11-08 16:00:16,946 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 815 transitions. Word has length 75 [2024-11-08 16:00:16,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:16,946 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 815 transitions. [2024-11-08 16:00:16,946 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-11-08 16:00:16,946 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 815 transitions. [2024-11-08 16:00:16,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 16:00:16,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:16,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:16,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 16:00:16,948 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-11-08 16:00:16,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:16,948 INFO L85 PathProgramCache]: Analyzing trace with hash 95104542, now seen corresponding path program 1 times [2024-11-08 16:00:16,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:16,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389715993] [2024-11-08 16:00:16,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:16,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:17,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-11-08 16:00:17,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:17,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389715993] [2024-11-08 16:00:17,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389715993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:17,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:17,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:00:17,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044700315] [2024-11-08 16:00:17,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:17,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:00:17,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:17,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:00:17,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:00:17,036 INFO L87 Difference]: Start difference. First operand 590 states and 815 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:17,094 INFO L93 Difference]: Finished difference Result 1051 states and 1467 transitions. [2024-11-08 16:00:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:00:17,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-08 16:00:17,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:17,098 INFO L225 Difference]: With dead ends: 1051 [2024-11-08 16:00:17,098 INFO L226 Difference]: Without dead ends: 898 [2024-11-08 16:00:17,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:00:17,099 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 284 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:17,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 453 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:00:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-11-08 16:00:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 741. [2024-11-08 16:00:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 1.3905405405405404) internal successors, (1029), 740 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1029 transitions. [2024-11-08 16:00:17,118 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1029 transitions. Word has length 75 [2024-11-08 16:00:17,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:17,119 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1029 transitions. [2024-11-08 16:00:17,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1029 transitions. [2024-11-08 16:00:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 16:00:17,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:17,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:17,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 16:00:17,120 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-11-08 16:00:17,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:17,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1963614716, now seen corresponding path program 1 times [2024-11-08 16:00:17,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:17,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431947048] [2024-11-08 16:00:17,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:17,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:17,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:17,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431947048] [2024-11-08 16:00:17,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431947048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:17,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:17,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:00:17,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894822665] [2024-11-08 16:00:17,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:17,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:00:17,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:17,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:00:17,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:00:17,212 INFO L87 Difference]: Start difference. First operand 741 states and 1029 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-11-08 16:00:17,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:17,233 INFO L93 Difference]: Finished difference Result 1862 states and 2600 transitions. [2024-11-08 16:00:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:00:17,235 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-11-08 16:00:17,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:17,238 INFO L225 Difference]: With dead ends: 1862 [2024-11-08 16:00:17,238 INFO L226 Difference]: Without dead ends: 1180 [2024-11-08 16:00:17,239 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-11-08 16:00:17,240 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 59 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:17,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 266 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:00:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2024-11-08 16:00:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1106. [2024-11-08 16:00:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1105 states have (on average 1.3800904977375565) internal successors, (1525), 1105 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1525 transitions. [2024-11-08 16:00:17,260 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1525 transitions. Word has length 76 [2024-11-08 16:00:17,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:17,260 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1525 transitions. [2024-11-08 16:00:17,260 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-11-08 16:00:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1525 transitions. [2024-11-08 16:00:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 16:00:17,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:17,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:17,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 16:00:17,263 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-11-08 16:00:17,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:17,263 INFO L85 PathProgramCache]: Analyzing trace with hash -628172474, now seen corresponding path program 1 times [2024-11-08 16:00:17,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:17,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784303820] [2024-11-08 16:00:17,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:17,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:17,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:17,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784303820] [2024-11-08 16:00:17,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784303820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:17,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:17,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:00:17,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937655525] [2024-11-08 16:00:17,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:17,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:00:17,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:17,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:00:17,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:00:17,348 INFO L87 Difference]: Start difference. First operand 1106 states and 1525 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-11-08 16:00:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:17,373 INFO L93 Difference]: Finished difference Result 3092 states and 4260 transitions. [2024-11-08 16:00:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:00:17,373 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-11-08 16:00:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:17,379 INFO L225 Difference]: With dead ends: 3092 [2024-11-08 16:00:17,379 INFO L226 Difference]: Without dead ends: 2045 [2024-11-08 16:00:17,382 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-11-08 16:00:17,383 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 52 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:17,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 265 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:00:17,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2024-11-08 16:00:17,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1935. [2024-11-08 16:00:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1934 states have (on average 1.3624612202688728) internal successors, (2635), 1934 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2635 transitions. [2024-11-08 16:00:17,419 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2635 transitions. Word has length 77 [2024-11-08 16:00:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:17,420 INFO L471 AbstractCegarLoop]: Abstraction has 1935 states and 2635 transitions. [2024-11-08 16:00:17,420 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-11-08 16:00:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2635 transitions. [2024-11-08 16:00:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 16:00:17,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:17,421 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-11-08 16:00:17,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 16:00:17,422 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-11-08 16:00:17,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash -763788569, now seen corresponding path program 1 times [2024-11-08 16:00:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:17,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471194231] [2024-11-08 16:00:17,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:17,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:17,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:17,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471194231] [2024-11-08 16:00:17,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471194231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:17,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:17,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:00:17,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444238633] [2024-11-08 16:00:17,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:17,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:00:17,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:17,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:00:17,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:00:17,504 INFO L87 Difference]: Start difference. First operand 1935 states and 2635 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-11-08 16:00:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:17,536 INFO L93 Difference]: Finished difference Result 5471 states and 7401 transitions. [2024-11-08 16:00:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:00:17,537 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-11-08 16:00:17,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:17,547 INFO L225 Difference]: With dead ends: 5471 [2024-11-08 16:00:17,548 INFO L226 Difference]: Without dead ends: 3595 [2024-11-08 16:00:17,551 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-11-08 16:00:17,551 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 42 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:17,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 263 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:00:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3595 states. [2024-11-08 16:00:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3595 to 3377. [2024-11-08 16:00:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3377 states, 3376 states have (on average 1.3341232227488151) internal successors, (4504), 3376 states have internal predecessors, (4504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 4504 transitions. [2024-11-08 16:00:17,642 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 4504 transitions. Word has length 78 [2024-11-08 16:00:17,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:17,642 INFO L471 AbstractCegarLoop]: Abstraction has 3377 states and 4504 transitions. [2024-11-08 16:00:17,642 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-11-08 16:00:17,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 4504 transitions. [2024-11-08 16:00:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 16:00:17,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:17,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:17,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 16:00:17,643 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-11-08 16:00:17,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1461539563, now seen corresponding path program 1 times [2024-11-08 16:00:17,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:17,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001137631] [2024-11-08 16:00:17,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:17,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:17,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:17,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001137631] [2024-11-08 16:00:17,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001137631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:17,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:17,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:00:17,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275118581] [2024-11-08 16:00:17,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:17,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:00:17,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:17,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:00:17,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:00:17,849 INFO L87 Difference]: Start difference. First operand 3377 states and 4504 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:17,890 INFO L93 Difference]: Finished difference Result 3475 states and 4633 transitions. [2024-11-08 16:00:17,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:00:17,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-08 16:00:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:17,900 INFO L225 Difference]: With dead ends: 3475 [2024-11-08 16:00:17,900 INFO L226 Difference]: Without dead ends: 3473 [2024-11-08 16:00:17,901 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-11-08 16:00:17,902 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:17,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:00:17,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3473 states. [2024-11-08 16:00:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3473 to 3473. [2024-11-08 16:00:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3473 states, 3472 states have (on average 1.3133640552995391) internal successors, (4560), 3472 states have internal predecessors, (4560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 4560 transitions. [2024-11-08 16:00:17,978 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 4560 transitions. Word has length 79 [2024-11-08 16:00:17,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:17,978 INFO L471 AbstractCegarLoop]: Abstraction has 3473 states and 4560 transitions. [2024-11-08 16:00:17,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 4560 transitions. [2024-11-08 16:00:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 16:00:17,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:00:17,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 16:00:17,980 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-11-08 16:00:17,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:17,980 INFO L85 PathProgramCache]: Analyzing trace with hash 965347417, now seen corresponding path program 1 times [2024-11-08 16:00:17,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:17,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820020045] [2024-11-08 16:00:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:18,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:18,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820020045] [2024-11-08 16:00:18,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820020045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:18,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:18,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:00:18,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071628717] [2024-11-08 16:00:18,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:18,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:00:18,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:18,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:00:18,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:00:18,029 INFO L87 Difference]: Start difference. First operand 3473 states and 4560 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:18,067 INFO L93 Difference]: Finished difference Result 7021 states and 9234 transitions. [2024-11-08 16:00:18,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:00:18,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-08 16:00:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:18,078 INFO L225 Difference]: With dead ends: 7021 [2024-11-08 16:00:18,079 INFO L226 Difference]: Without dead ends: 3607 [2024-11-08 16:00:18,083 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-11-08 16:00:18,085 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:18,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 216 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:00:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2024-11-08 16:00:18,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3605. [2024-11-08 16:00:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3605 states, 3604 states have (on average 1.293007769145394) internal successors, (4660), 3604 states have internal predecessors, (4660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3605 states to 3605 states and 4660 transitions. [2024-11-08 16:00:18,145 INFO L78 Accepts]: Start accepts. Automaton has 3605 states and 4660 transitions. Word has length 79 [2024-11-08 16:00:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:18,145 INFO L471 AbstractCegarLoop]: Abstraction has 3605 states and 4660 transitions. [2024-11-08 16:00:18,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3605 states and 4660 transitions. [2024-11-08 16:00:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 16:00:18,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:18,147 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-11-08 16:00:18,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 16:00:18,148 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-11-08 16:00:18,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:18,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1381911094, now seen corresponding path program 1 times [2024-11-08 16:00:18,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:18,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499184025] [2024-11-08 16:00:18,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:18,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:18,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:18,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499184025] [2024-11-08 16:00:18,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499184025] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:00:18,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561884672] [2024-11-08 16:00:18,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:18,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:00:18,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:00:18,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:00:18,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:00:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:18,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 16:00:18,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:00:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:19,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:00:20,902 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:20,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561884672] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:00:20,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:00:20,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2024-11-08 16:00:20,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015515324] [2024-11-08 16:00:20,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:00:20,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 16:00:20,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:20,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 16:00:20,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2024-11-08 16:00:20,905 INFO L87 Difference]: Start difference. First operand 3605 states and 4660 transitions. Second operand has 30 states, 30 states have (on average 9.033333333333333) internal successors, (271), 29 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:24,917 INFO L93 Difference]: Finished difference Result 33517 states and 43327 transitions. [2024-11-08 16:00:24,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-11-08 16:00:24,917 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.033333333333333) internal successors, (271), 29 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-11-08 16:00:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:24,988 INFO L225 Difference]: With dead ends: 33517 [2024-11-08 16:00:24,988 INFO L226 Difference]: Without dead ends: 29971 [2024-11-08 16:00:25,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7135 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3290, Invalid=18466, Unknown=0, NotChecked=0, Total=21756 [2024-11-08 16:00:25,008 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 2587 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2587 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 2196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:25,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2587 Valid, 2118 Invalid, 2196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2167 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 16:00:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29971 states. [2024-11-08 16:00:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29971 to 18926. [2024-11-08 16:00:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18926 states, 18925 states have (on average 1.2861294583883751) internal successors, (24340), 18925 states have internal predecessors, (24340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18926 states to 18926 states and 24340 transitions. [2024-11-08 16:00:25,486 INFO L78 Accepts]: Start accepts. Automaton has 18926 states and 24340 transitions. Word has length 101 [2024-11-08 16:00:25,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:25,487 INFO L471 AbstractCegarLoop]: Abstraction has 18926 states and 24340 transitions. [2024-11-08 16:00:25,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.033333333333333) internal successors, (271), 29 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 18926 states and 24340 transitions. [2024-11-08 16:00:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 16:00:25,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:25,492 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-11-08 16:00:25,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 16:00:25,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:00:25,697 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-11-08 16:00:25,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:25,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1412305418, now seen corresponding path program 1 times [2024-11-08 16:00:25,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:25,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550578855] [2024-11-08 16:00:25,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:25,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:26,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:26,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550578855] [2024-11-08 16:00:26,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550578855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:00:26,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499311205] [2024-11-08 16:00:26,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:26,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:00:26,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:00:26,017 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:00:26,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:00:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:26,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 16:00:26,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:00:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:26,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:00:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:27,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499311205] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:00:27,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:00:27,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-08 16:00:27,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288584336] [2024-11-08 16:00:27,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:00:27,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 16:00:27,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:27,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 16:00:27,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2024-11-08 16:00:27,267 INFO L87 Difference]: Start difference. First operand 18926 states and 24340 transitions. Second operand has 24 states, 24 states have (on average 11.375) internal successors, (273), 24 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:31,027 INFO L93 Difference]: Finished difference Result 59321 states and 76461 transitions. [2024-11-08 16:00:31,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-11-08 16:00:31,028 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 11.375) internal successors, (273), 24 states have internal predecessors, (273), 0 states have call successors, (0), 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-11-08 16:00:31,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:31,126 INFO L225 Difference]: With dead ends: 59321 [2024-11-08 16:00:31,126 INFO L226 Difference]: Without dead ends: 55775 [2024-11-08 16:00:31,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5636 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2506, Invalid=14006, Unknown=0, NotChecked=0, Total=16512 [2024-11-08 16:00:31,149 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 2468 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2468 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:31,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2468 Valid, 1677 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:00:31,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55775 states. [2024-11-08 16:00:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55775 to 18907. [2024-11-08 16:00:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18907 states, 18906 states have (on average 1.2862583306886703) internal successors, (24318), 18906 states have internal predecessors, (24318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18907 states to 18907 states and 24318 transitions. [2024-11-08 16:00:31,586 INFO L78 Accepts]: Start accepts. Automaton has 18907 states and 24318 transitions. Word has length 102 [2024-11-08 16:00:31,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:31,586 INFO L471 AbstractCegarLoop]: Abstraction has 18907 states and 24318 transitions. [2024-11-08 16:00:31,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.375) internal successors, (273), 24 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 18907 states and 24318 transitions. [2024-11-08 16:00:31,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 16:00:31,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:31,590 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] [2024-11-08 16:00:31,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 16:00:31,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-08 16:00:31,794 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-08 16:00:31,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:31,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1454501220, now seen corresponding path program 1 times [2024-11-08 16:00:31,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:31,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188135465] [2024-11-08 16:00:31,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:31,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:32,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:32,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:32,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188135465] [2024-11-08 16:00:32,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188135465] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:00:32,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475938202] [2024-11-08 16:00:32,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:32,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:00:32,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:00:32,350 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:00:32,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 16:00:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:32,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 16:00:32,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:00:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:33,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:00:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:33,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475938202] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:00:33,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:00:33,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 29 [2024-11-08 16:00:33,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698119309] [2024-11-08 16:00:33,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:00:33,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-08 16:00:33,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:33,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-08 16:00:33,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2024-11-08 16:00:33,781 INFO L87 Difference]: Start difference. First operand 18907 states and 24318 transitions. Second operand has 29 states, 29 states have (on average 9.689655172413794) internal successors, (281), 29 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:43,308 INFO L93 Difference]: Finished difference Result 125342 states and 159793 transitions. [2024-11-08 16:00:43,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2024-11-08 16:00:43,308 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.689655172413794) internal successors, (281), 29 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-08 16:00:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:43,516 INFO L225 Difference]: With dead ends: 125342 [2024-11-08 16:00:43,516 INFO L226 Difference]: Without dead ends: 106501 [2024-11-08 16:00:43,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19334 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=7288, Invalid=42218, Unknown=0, NotChecked=0, Total=49506 [2024-11-08 16:00:43,566 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 4002 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 2673 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4002 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 2780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:43,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4002 Valid, 1740 Invalid, 2780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2673 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 16:00:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106501 states. [2024-11-08 16:00:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106501 to 71252. [2024-11-08 16:00:44,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71252 states, 71251 states have (on average 1.278045220417959) internal successors, (91062), 71251 states have internal predecessors, (91062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71252 states to 71252 states and 91062 transitions. [2024-11-08 16:00:45,224 INFO L78 Accepts]: Start accepts. Automaton has 71252 states and 91062 transitions. Word has length 102 [2024-11-08 16:00:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:45,224 INFO L471 AbstractCegarLoop]: Abstraction has 71252 states and 91062 transitions. [2024-11-08 16:00:45,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.689655172413794) internal successors, (281), 29 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 71252 states and 91062 transitions. [2024-11-08 16:00:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 16:00:45,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:45,234 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-11-08 16:00:45,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 16:00:45,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:00:45,435 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-08 16:00:45,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:45,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1056316079, now seen corresponding path program 1 times [2024-11-08 16:00:45,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:45,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012948885] [2024-11-08 16:00:45,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:45,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 16:00:45,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:45,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012948885] [2024-11-08 16:00:45,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012948885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:45,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:45,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:00:45,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88747481] [2024-11-08 16:00:45,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:45,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:00:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:45,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:00:45,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:00:45,484 INFO L87 Difference]: Start difference. First operand 71252 states and 91062 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:45,889 INFO L93 Difference]: Finished difference Result 128365 states and 164586 transitions. [2024-11-08 16:00:45,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:00:45,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-11-08 16:00:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:45,990 INFO L225 Difference]: With dead ends: 128365 [2024-11-08 16:00:45,991 INFO L226 Difference]: Without dead ends: 57231 [2024-11-08 16:00:46,054 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-11-08 16:00:46,055 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:46,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 103 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:00:46,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57231 states. [2024-11-08 16:00:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57231 to 57231. [2024-11-08 16:00:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57231 states, 57230 states have (on average 1.2705573999650532) internal successors, (72714), 57230 states have internal predecessors, (72714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57231 states to 57231 states and 72714 transitions. [2024-11-08 16:00:47,002 INFO L78 Accepts]: Start accepts. Automaton has 57231 states and 72714 transitions. Word has length 103 [2024-11-08 16:00:47,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:47,003 INFO L471 AbstractCegarLoop]: Abstraction has 57231 states and 72714 transitions. [2024-11-08 16:00:47,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:47,003 INFO L276 IsEmpty]: Start isEmpty. Operand 57231 states and 72714 transitions. [2024-11-08 16:00:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 16:00:47,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:47,009 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-11-08 16:00:47,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 16:00:47,009 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-08 16:00:47,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:47,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1351748178, now seen corresponding path program 1 times [2024-11-08 16:00:47,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:47,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697598394] [2024-11-08 16:00:47,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:47,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 16:00:47,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:47,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697598394] [2024-11-08 16:00:47,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697598394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:47,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:47,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:00:47,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979771863] [2024-11-08 16:00:47,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:47,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:00:47,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:47,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:00:47,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:00:47,340 INFO L87 Difference]: Start difference. First operand 57231 states and 72714 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:00:47,944 INFO L93 Difference]: Finished difference Result 138552 states and 175870 transitions. [2024-11-08 16:00:47,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:00:47,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-11-08 16:00:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:00:48,057 INFO L225 Difference]: With dead ends: 138552 [2024-11-08 16:00:48,057 INFO L226 Difference]: Without dead ends: 81415 [2024-11-08 16:00:48,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:00:48,107 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 369 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:00:48,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 451 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:00:48,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81415 states. [2024-11-08 16:00:48,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81415 to 57231. [2024-11-08 16:00:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57231 states, 57230 states have (on average 1.2704875065525074) internal successors, (72710), 57230 states have internal predecessors, (72710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57231 states to 57231 states and 72710 transitions. [2024-11-08 16:00:48,969 INFO L78 Accepts]: Start accepts. Automaton has 57231 states and 72710 transitions. Word has length 103 [2024-11-08 16:00:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:48,969 INFO L471 AbstractCegarLoop]: Abstraction has 57231 states and 72710 transitions. [2024-11-08 16:00:48,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 57231 states and 72710 transitions. [2024-11-08 16:00:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 16:00:48,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:48,975 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, 1] [2024-11-08 16:00:48,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 16:00:48,975 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-08 16:00:48,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2021168627, now seen corresponding path program 1 times [2024-11-08 16:00:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:48,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797993323] [2024-11-08 16:00:48,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:48,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:50,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:50,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797993323] [2024-11-08 16:00:50,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797993323] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:00:50,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52816340] [2024-11-08 16:00:50,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:50,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:00:50,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:00:50,005 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:00:50,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 16:00:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:50,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 16:00:50,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:00:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:51,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:00:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:54,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52816340] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:00:54,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:00:54,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 46 [2024-11-08 16:00:54,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254297257] [2024-11-08 16:00:54,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:00:54,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-08 16:00:54,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:54,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-08 16:00:54,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2024-11-08 16:00:54,547 INFO L87 Difference]: Start difference. First operand 57231 states and 72710 transitions. Second operand has 46 states, 46 states have (on average 6.130434782608695) internal successors, (282), 46 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)