./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-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 d0e47ba9123028218b420ce8d5a00a95c55595f981ba1193a1a3a9086d3ecf65 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:08:24,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:08:24,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:08:24,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:08:24,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:08:24,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:08:24,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:08:24,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:08:24,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:08:24,373 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:08:24,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:08:24,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:08:24,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:08:24,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:08:24,374 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:08:24,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:08:24,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:08:24,375 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:08:24,376 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:08:24,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:08:24,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:08:24,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:08:24,377 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> d0e47ba9123028218b420ce8d5a00a95c55595f981ba1193a1a3a9086d3ecf65 [2025-03-03 15:08:24,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:08:24,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:08:24,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:08:24,642 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:08:24,642 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:08:24,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-03-03 15:08:25,865 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23285ffd2/c88b463802384c6885e81aa2a5d0a99c/FLAGa3449617b [2025-03-03 15:08:26,329 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:08:26,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-03-03 15:08:26,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23285ffd2/c88b463802384c6885e81aa2a5d0a99c/FLAGa3449617b [2025-03-03 15:08:26,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23285ffd2/c88b463802384c6885e81aa2a5d0a99c [2025-03-03 15:08:26,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:08:26,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:08:26,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:08:26,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:08:26,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:08:26,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:08:26" (1/1) ... [2025-03-03 15:08:26,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76fef4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:26, skipping insertion in model container [2025-03-03 15:08:26,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:08:26" (1/1) ... [2025-03-03 15:08:26,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:08:26,966 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32607,32620] [2025-03-03 15:08:26,988 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[39665,39678] [2025-03-03 15:08:27,050 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[66766,66779] [2025-03-03 15:08:27,068 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[75829,75842] [2025-03-03 15:08:27,080 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[82520,82533] [2025-03-03 15:08:27,097 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[94424,94437] [2025-03-03 15:08:27,109 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[103377,103390] [2025-03-03 15:08:27,120 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[111402,111415] [2025-03-03 15:08:27,201 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[149914,149927] [2025-03-03 15:08:27,206 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[153444,153457] [2025-03-03 15:08:27,216 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[162451,162464] [2025-03-03 15:08:27,229 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[169104,169117] [2025-03-03 15:08:27,264 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[194798,194811] [2025-03-03 15:08:27,297 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[226694,226707] [2025-03-03 15:08:27,329 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[256902,256915] [2025-03-03 15:08:27,360 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[287214,287227] [2025-03-03 15:08:27,395 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[320546,320559] [2025-03-03 15:08:27,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:08:27,583 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:08:27,665 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32607,32620] [2025-03-03 15:08:27,673 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[39665,39678] [2025-03-03 15:08:27,704 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[66766,66779] [2025-03-03 15:08:27,714 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[75829,75842] [2025-03-03 15:08:27,722 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[82520,82533] [2025-03-03 15:08:27,735 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[94424,94437] [2025-03-03 15:08:27,746 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[103377,103390] [2025-03-03 15:08:27,755 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[111402,111415] [2025-03-03 15:08:27,794 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[149914,149927] [2025-03-03 15:08:27,798 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[153444,153457] [2025-03-03 15:08:27,808 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[162451,162464] [2025-03-03 15:08:27,815 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[169104,169117] [2025-03-03 15:08:27,839 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[194798,194811] [2025-03-03 15:08:27,866 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[226694,226707] [2025-03-03 15:08:27,892 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[256902,256915] [2025-03-03 15:08:27,943 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[287214,287227] [2025-03-03 15:08:27,973 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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[320546,320559] [2025-03-03 15:08:28,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:08:28,118 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:08:28,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:28 WrapperNode [2025-03-03 15:08:28,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:08:28,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:08:28,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:08:28,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:08:28,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:28" (1/1) ... [2025-03-03 15:08:28,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:28" (1/1) ... [2025-03-03 15:08:28,461 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19338 [2025-03-03 15:08:28,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:08:28,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:08:28,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:08:28,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:08:28,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:28" (1/1) ... [2025-03-03 15:08:28,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:28" (1/1) ... [2025-03-03 15:08:28,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:28" (1/1) ... [2025-03-03 15:08:28,612 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]. [2025-03-03 15:08:28,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:28" (1/1) ... [2025-03-03 15:08:28,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:28" (1/1) ... [2025-03-03 15:08:28,712 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:28" (1/1) ... [2025-03-03 15:08:28,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:28" (1/1) ... [2025-03-03 15:08:28,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:28" (1/1) ... [2025-03-03 15:08:28,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:28" (1/1) ... [2025-03-03 15:08:28,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:08:28,831 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:08:28,831 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:08:28,831 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:08:28,832 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:28" (1/1) ... [2025-03-03 15:08:28,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:08:28,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:08:28,862 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) [2025-03-03 15:08:28,868 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 [2025-03-03 15:08:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:08:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:08:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:08:28,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:08:29,325 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:08:29,327 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:08:35,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7897: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:08:35,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24283: havoc main_~node4__m4~91#1;havoc main_~node3__m3~89#1;havoc main_~node2__m2~106#1;havoc main_~node1__m1~121#1;havoc main_~main____CPAchecker_TMP_0~126#1;havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~148#1; [2025-03-03 15:08:35,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L32212: havoc main_~node2__m2~132#1;havoc main_~node1____CPAchecker_TMP_1~35#1;havoc main_~node1__m1~179#1;havoc main_~main____CPAchecker_TMP_0~184#1;havoc main_~__tmp_201~0#1, main_~assert__arg~200#1;havoc main_~check__tmp~206#1;havoc main_~node4__m4~120#1;havoc main_~node3__m3~113#1;havoc main_~node2__m2~131#1;havoc main_~node1__m1~178#1;havoc main_~main____CPAchecker_TMP_0~183#1;havoc main_~__tmp_200~0#1, main_~assert__arg~199#1;havoc main_~check__tmp~205#1; [2025-03-03 15:08:35,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18999: havoc main_~node3__m3~70#1; [2025-03-03 15:08:35,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18472: havoc main_~node1____CPAchecker_TMP_0~10#1; [2025-03-03 15:08:35,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13717: havoc main_~node4__m4~47#1; [2025-03-03 15:08:35,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30104: havoc main_~node4____CPAchecker_TMP_0~34#1; [2025-03-03 15:08:35,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19009: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-03 15:08:35,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L32222: havoc main_~node2____CPAchecker_TMP_0~9#1; [2025-03-03 15:08:35,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13727: havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-03-03 15:08:35,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6328: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:35,897 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8446: havoc main_~node1__m1~35#1;havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~49#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~33#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~34#1;havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~48#1; [2025-03-03 15:08:35,897 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3690: havoc main_~node3__m3~13#1;havoc main_~node2__m2~13#1;havoc main_~node1__m1~13#1;havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19018: havoc main_~node4__m4~69#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15850: havoc main_~node3__m3~59#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10565: havoc main_~node2__m2~46#1;havoc main_~node1__m1~49#1;havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~63#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16380: havoc main_~main____CPAchecker_TMP_0~81#1;havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~99#1;havoc main_~node4__m4~57#1;havoc main_~node3__m3~60#1;havoc main_~node2__m2~73#1;havoc main_~node1__m1~77#1;havoc main_~main____CPAchecker_TMP_0~80#1;havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~98#1;havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21138: havoc main_~node1____CPAchecker_TMP_1~15#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7925: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22196: havoc main_~node4__m4~83#1;havoc main_~node3__m3~82#1;havoc main_~node2__m2~96#1;havoc main_~node1__m1~109#1;havoc main_~main____CPAchecker_TMP_0~114#1;havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~135#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8456: havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22727: havoc main_~node1__m1~113#1;havoc main_~main____CPAchecker_TMP_0~118#1;havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~139#1;havoc main_~node4__m4~86#1;havoc main_~node3__m3~84#1;havoc main_~node2__m2~98#1;havoc main_~node1__m1~112#1;havoc main_~main____CPAchecker_TMP_0~117#1;havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~138#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19028: havoc main_~node4____CPAchecker_TMP_0~21#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18500: havoc main_~node1____CPAchecker_TMP_1~9#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23786: havoc main_~node1__m1~118#1;havoc main_~main____CPAchecker_TMP_0~123#1;havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~144#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16916: havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~103#1;havoc main_~node4__m4~60#1;havoc main_~node3__m3~62#1;havoc main_~node2__m2~75#1;havoc main_~node1__m1~80#1;havoc main_~main____CPAchecker_TMP_0~84#1;havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~102#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14803: havoc main_~main____CPAchecker_TMP_0~73#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~91#1;havoc main_~node4__m4~50#1;havoc main_~node3__m3~54#1;havoc main_~node2__m2~67#1;havoc main_~node1__m1~70#1;havoc main_~main____CPAchecker_TMP_0~72#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~90#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11632: havoc main_~node4__m4~39#1;havoc main_~node3__m3~38#1;havoc main_~node2__m2~52#1;havoc main_~node1__m1~54#1;havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~70#1;havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-03-03 15:08:35,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29075: havoc main_~node1__m1~155#1;havoc main_~main____CPAchecker_TMP_0~160#1;havoc main_~__tmp_177~0#1, main_~assert__arg~176#1;havoc main_~check__tmp~182#1;havoc main_~node4____CPAchecker_TMP_1~32#1; [2025-03-03 15:08:35,899 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22737: havoc main_~node1____CPAchecker_TMP_0~19#1; [2025-03-03 15:08:35,899 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L32251: havoc main_~node2____CPAchecker_TMP_1~12#1; [2025-03-03 15:08:35,899 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1600: havoc main_~node4__m4~4#1;havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~5#1; [2025-03-03 15:08:35,899 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28556: havoc main_~node4__m4~106#1; [2025-03-03 15:08:35,899 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L31199: havoc main_~node1____CPAchecker_TMP_1~33#1;havoc main_~node1__m1~171#1;havoc main_~main____CPAchecker_TMP_0~176#1;havoc main_~__tmp_193~0#1, main_~assert__arg~192#1;havoc main_~check__tmp~198#1;havoc main_~node4__m4~116#1;havoc main_~node3__m3~110#1;havoc main_~node2__m2~128#1;havoc main_~node1__m1~170#1;havoc main_~main____CPAchecker_TMP_0~175#1;havoc main_~__tmp_192~0#1, main_~assert__arg~191#1;havoc main_~check__tmp~197#1; [2025-03-03 15:08:35,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30145: havoc main_~node1__m1~163#1;havoc main_~main____CPAchecker_TMP_0~168#1;havoc main_~__tmp_185~0#1, main_~assert__arg~184#1;havoc main_~check__tmp~190#1; [2025-03-03 15:08:35,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25920: havoc main_~node3__m3~94#1;havoc main_~node2__m2~111#1;havoc main_~node1__m1~133#1;havoc main_~main____CPAchecker_TMP_0~138#1;havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~160#1; [2025-03-03 15:08:35,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14294: havoc main_~node3__m3~51#1;havoc main_~node2__m2~65#1;havoc main_~node1__m1~68#1;havoc main_~main____CPAchecker_TMP_0~69#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~87#1; [2025-03-03 15:08:35,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28566: havoc main_~node4____CPAchecker_TMP_0~32#1; [2025-03-03 15:08:35,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9012: havoc main_~node2__m2~35#1;havoc main_~node1__m1~38#1;havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~52#1;havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-03-03 15:08:35,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8485: havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-03-03 15:08:35,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4257: havoc main_~node3__m3~16#1;havoc main_~node2__m2~16#1;havoc main_~node1__m1~16#1;havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-03-03 15:08:35,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6903: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~39#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~27#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~27#1;havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~38#1; [2025-03-03 15:08:35,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11134: havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~67#1;havoc main_~node4__m4~37#1;havoc main_~node3__m3~36#1;havoc main_~node2__m2~50#1;havoc main_~node1__m1~52#1;havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~66#1; [2025-03-03 15:08:35,901 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15891: havoc main_~node4__m4~56#1; [2025-03-03 15:08:35,901 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093: havoc main_~check__tmp~3#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~2#1; [2025-03-03 15:08:35,901 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26990: havoc main_~node4__m4~100#1; [2025-03-03 15:08:35,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22767: havoc main_~node1____CPAchecker_TMP_1~18#1; [2025-03-03 15:08:35,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21183: havoc main_~node2____CPAchecker_TMP_1~4#1;havoc main_~node2__m2~92#1; [2025-03-03 15:08:35,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21712: havoc main_~node1__m1~107#1;havoc main_~main____CPAchecker_TMP_0~112#1;havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~133#1;havoc main_~node4__m4~81#1;havoc main_~node3__m3~80#1;havoc main_~node2__m2~94#1;havoc main_~node1__m1~106#1;havoc main_~main____CPAchecker_TMP_0~111#1;havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~132#1; [2025-03-03 15:08:35,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7443: havoc main_~node4__m4~27#1; [2025-03-03 15:08:35,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27000: havoc main_~node4____CPAchecker_TMP_0~30#1; [2025-03-03 15:08:35,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2161: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~9#1;havoc main_~node4__m4~7#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~6#1;havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~8#1; [2025-03-03 15:08:35,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24891: havoc main_~node1__m1~125#1;havoc main_~main____CPAchecker_TMP_0~130#1;havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~152#1;havoc main_~node4____CPAchecker_TMP_1~26#1; [2025-03-03 15:08:35,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L580: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:08:35,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7453: havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-03 15:08:35,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~25#1;havoc main_~node4__m4~14#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~18#1;havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~24#1; [2025-03-03 15:08:35,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2699: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~13#1;havoc main_~node4__m4~9#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1;havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~12#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25425: havoc main_~node3__m3~92#1;havoc main_~node2__m2~109#1;havoc main_~node1__m1~129#1;havoc main_~main____CPAchecker_TMP_0~134#1;havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~156#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20142: havoc main_~node1__m1~98#1;havoc main_~main____CPAchecker_TMP_0~103#1;havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~123#1;havoc main_~node4__m4~75#1;havoc main_~node3__m3~75#1;havoc main_~node2__m2~88#1;havoc main_~node1__m1~97#1;havoc main_~main____CPAchecker_TMP_0~102#1;havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~122#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9573: havoc main_~node2__m2~39#1;havoc main_~node1__m1~42#1;havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~56#1;havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L590: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13808: havoc main_~node3__m3~48#1;havoc main_~node2__m2~62#1;havoc main_~node1__m1~65#1;havoc main_~main____CPAchecker_TMP_0~66#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~84#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28607: havoc main_~node1__m1~152#1;havoc main_~main____CPAchecker_TMP_0~157#1;havoc main_~__tmp_174~0#1, main_~assert__arg~173#1;havoc main_~check__tmp~179#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L600: havoc main_~node2__m2~0#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5358: havoc main_~node4__m4~17#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28087: havoc main_~node1__m1~149#1;havoc main_~main____CPAchecker_TMP_0~154#1;havoc main_~__tmp_171~0#1, main_~assert__arg~170#1;havoc main_~check__tmp~176#1;havoc main_~node4__m4~104#1;havoc main_~node3__m3~101#1;havoc main_~node2__m2~118#1;havoc main_~node1__m1~148#1;havoc main_~main____CPAchecker_TMP_0~153#1;havoc main_~__tmp_170~0#1, main_~assert__arg~169#1;havoc main_~check__tmp~175#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22277: havoc main_~node4__m4~84#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24392: havoc main_~node4__m4~92#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L610: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5368: havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15939: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22812: havoc main_~node2____CPAchecker_TMP_1~5#1;havoc main_~node2__m2~99#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27041: havoc main_~node1__m1~141#1;havoc main_~main____CPAchecker_TMP_0~146#1;havoc main_~__tmp_163~0#1, main_~assert__arg~162#1;havoc main_~check__tmp~168#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26515: havoc main_~node1__m1~138#1;havoc main_~main____CPAchecker_TMP_0~143#1;havoc main_~__tmp_160~0#1, main_~assert__arg~159#1;havoc main_~check__tmp~165#1;havoc main_~node4__m4~98#1;havoc main_~node3__m3~97#1;havoc main_~node2__m2~113#1;havoc main_~node1__m1~137#1;havoc main_~main____CPAchecker_TMP_0~142#1;havoc main_~__tmp_159~0#1, main_~assert__arg~158#1;havoc main_~check__tmp~164#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22287: havoc main_~node4____CPAchecker_TMP_0~24#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24402: havoc main_~node4____CPAchecker_TMP_0~26#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L620: havoc main_~node3__m3~0#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21761: havoc main_~node1____CPAchecker_TMP_0~17#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29696: havoc main_~node1____CPAchecker_TMP_1~30#1;havoc main_~node1__m1~160#1;havoc main_~main____CPAchecker_TMP_0~165#1;havoc main_~__tmp_182~0#1, main_~assert__arg~181#1;havoc main_~check__tmp~187#1;havoc main_~node4__m4~110#1;havoc main_~node3__m3~106#1;havoc main_~node2__m2~123#1;havoc main_~node1__m1~159#1;havoc main_~main____CPAchecker_TMP_0~164#1;havoc main_~__tmp_181~0#1, main_~assert__arg~180#1;havoc main_~check__tmp~186#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L630: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10148: havoc main_~node2__m2~43#1;havoc main_~node1__m1~46#1;havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~60#1;havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15433: havoc main_~node1__m1~74#1;havoc main_~main____CPAchecker_TMP_0~77#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~95#1;havoc main_~node4__m4~54#1;havoc main_~node3__m3~57#1;havoc main_~node2__m2~70#1;havoc main_~node1__m1~73#1;havoc main_~main____CPAchecker_TMP_0~76#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~94#1; [2025-03-03 15:08:35,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20191: havoc main_~node1____CPAchecker_TMP_0~13#1; [2025-03-03 15:08:35,905 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14378: havoc main_~node3__m3~52#1; [2025-03-03 15:08:35,905 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23363: havoc main_~node1__m1~117#1;havoc main_~main____CPAchecker_TMP_0~122#1;havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~143#1;havoc main_~node4__m4~88#1;havoc main_~node3__m3~86#1;havoc main_~node2__m2~101#1;havoc main_~node1__m1~116#1;havoc main_~main____CPAchecker_TMP_0~121#1;havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~142#1; [2025-03-03 15:08:35,905 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27591: havoc main_~node1__m1~146#1;havoc main_~main____CPAchecker_TMP_0~151#1;havoc main_~__tmp_168~0#1, main_~assert__arg~167#1;havoc main_~check__tmp~173#1;havoc main_~node4__m4~102#1;havoc main_~node3__m3~100#1;havoc main_~node2__m2~116#1;havoc main_~node1__m1~145#1;havoc main_~main____CPAchecker_TMP_0~150#1;havoc main_~__tmp_167~0#1, main_~assert__arg~166#1;havoc main_~check__tmp~172#1; [2025-03-03 15:08:35,905 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13322: havoc main_~node3__m3~45#1;havoc main_~node2__m2~59#1;havoc main_~node1__m1~62#1;havoc main_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~81#1; [2025-03-03 15:08:35,905 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17551: havoc main_~node4__m4~63#1;havoc main_~node3__m3~65#1;havoc main_~node2__m2~78#1;havoc main_~node1__m1~83#1;havoc main_~main____CPAchecker_TMP_0~88#1;havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~107#1; [2025-03-03 15:08:35,905 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L639: havoc main_~node4__m4~0#1; [2025-03-03 15:08:35,905 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15967: havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-03-03 15:08:35,905 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14388: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21789: havoc main_~node1____CPAchecker_TMP_1~16#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L649: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27607: havoc main_~node1____CPAchecker_TMP_1~26#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28136: havoc main_~node1____CPAchecker_TMP_0~24#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14397: havoc main_~node4__m4~48#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6473: havoc main_~node4__m4~22#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24443: havoc main_~node1__m1~122#1;havoc main_~main____CPAchecker_TMP_0~127#1;havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~149#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10703: havoc main_~node2__m2~47#1;havoc main_~node1__m1~50#1;havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~64#1;havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4363: havoc main_~node3__m3~17#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20219: havoc main_~node1____CPAchecker_TMP_1~12#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L31848: havoc main_~node1____CPAchecker_TMP_1~34#1;havoc main_~node1__m1~176#1;havoc main_~main____CPAchecker_TMP_0~181#1;havoc main_~__tmp_198~0#1, main_~assert__arg~197#1;havoc main_~check__tmp~203#1;havoc main_~node4__m4~119#1;havoc main_~node3__m3~112#1;havoc main_~node2__m2~130#1;havoc main_~node1__m1~175#1;havoc main_~main____CPAchecker_TMP_0~180#1;havoc main_~__tmp_197~0#1, main_~assert__arg~196#1;havoc main_~check__tmp~202#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14407: havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19164: havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~117#1;havoc main_~node4__m4~70#1;havoc main_~node3__m3~71#1;havoc main_~node2__m2~84#1;havoc main_~node1__m1~92#1;havoc main_~main____CPAchecker_TMP_0~97#1;havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~116#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26564: havoc main_~node1____CPAchecker_TMP_0~23#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6483: havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3312: havoc main_~node3__m3~11#1;havoc main_~node2__m2~11#1;havoc main_~node1__m1~11#1;havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~16#1;havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23396: havoc main_~node2__m2~102#1;havoc main_~node1____CPAchecker_TMP_0~21#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26042: havoc main_~node1__m1~134#1;havoc main_~main____CPAchecker_TMP_0~139#1;havoc main_~__tmp_156~0#1, main_~assert__arg~155#1;havoc main_~check__tmp~161#1;havoc main_~node4____CPAchecker_TMP_1~28#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4373: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1731: havoc main_~node4__m4~5#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16002: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27635: havoc main_~node2__m2~117#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28164: havoc main_~node1____CPAchecker_TMP_1~27#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4382: havoc main_~node4__m4~12#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15482: havoc main_~node1____CPAchecker_TMP_0~5#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1741: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:08:35,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30810: havoc main_~node1____CPAchecker_TMP_1~32#1;havoc main_~node1__m1~168#1;havoc main_~main____CPAchecker_TMP_0~173#1;havoc main_~__tmp_190~0#1, main_~assert__arg~189#1;havoc main_~check__tmp~195#1;havoc main_~node4__m4~114#1;havoc main_~node3__m3~109#1;havoc main_~node2__m2~127#1;havoc main_~node1__m1~167#1;havoc main_~main____CPAchecker_TMP_0~172#1;havoc main_~__tmp_189~0#1, main_~assert__arg~188#1;havoc main_~check__tmp~194#1; [2025-03-03 15:08:35,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18126: havoc main_~node1__m1~87#1;havoc main_~main____CPAchecker_TMP_0~92#1;havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~111#1;havoc main_~node4__m4~66#1;havoc main_~node3__m3~67#1;havoc main_~node2__m2~80#1;havoc main_~node1__m1~86#1;havoc main_~main____CPAchecker_TMP_0~91#1;havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~110#1; [2025-03-03 15:08:35,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20770: havoc main_~node1__m1~102#1;havoc main_~main____CPAchecker_TMP_0~107#1;havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~127#1;havoc main_~node4__m4~77#1;havoc main_~node3__m3~77#1;havoc main_~node2__m2~90#1;havoc main_~node1__m1~101#1;havoc main_~main____CPAchecker_TMP_0~106#1;havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~126#1;havoc main_~node4____CPAchecker_TMP_1~22#1; [2025-03-03 15:08:35,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8614: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:35,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12844: havoc main_~node1__m1~60#1;havoc main_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~79#1;havoc main_~node4__m4~45#1;havoc main_~node3__m3~43#1;havoc main_~node2__m2~57#1;havoc main_~node1__m1~59#1;havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~78#1; [2025-03-03 15:08:35,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9147: havoc main_~node2__m2~36#1;havoc main_~node1__m1~39#1;havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~53#1; [2025-03-03 15:08:35,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4392: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-03 15:08:35,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19721: havoc main_~node4__m4~72#1;havoc main_~node3__m3~73#1;havoc main_~node2__m2~86#1;havoc main_~node1__m1~95#1;havoc main_~main____CPAchecker_TMP_0~100#1;havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~120#1;havoc main_~node4____CPAchecker_TMP_1~21#1; [2025-03-03 15:08:35,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18136: havoc main_~node1____CPAchecker_TMP_0~9#1; [2025-03-03 15:08:35,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26592: havoc main_~node1____CPAchecker_TMP_1~24#1; [2025-03-03 15:08:35,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21313: havoc main_~node4__m4~79#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-03 15:08:35,911 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16030: havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25547: havoc main_~node1__m1~130#1;havoc main_~main____CPAchecker_TMP_0~135#1;havoc main_~__tmp_152~0#1, main_~assert__arg~151#1;havoc main_~check__tmp~157#1;havoc main_~node4____CPAchecker_TMP_1~27#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3882: havoc main_~node3__m3~14#1;havoc main_~node2__m2~14#1;havoc main_~node1__m1~14#1;havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21323: havoc main_~node4____CPAchecker_TMP_0~23#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15510: havoc main_~node1____CPAchecker_TMP_1~4#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8640: havoc main_~node3__m3~34#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6000: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~33#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~23#1;havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~32#1;havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23444: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17632: havoc main_~node4__m4~64#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2835: havoc main_~node4__m4~10#1;havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23976: havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~146#1;havoc main_~node4__m4~90#1;havoc main_~node3__m3~88#1;havoc main_~node2__m2~105#1;havoc main_~node1__m1~119#1;havoc main_~main____CPAchecker_TMP_0~124#1;havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~145#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7592: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~43#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~30#1;havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~42#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L31375: havoc main_~node1__m1~172#1;havoc main_~main____CPAchecker_TMP_0~177#1;havoc main_~__tmp_194~0#1, main_~assert__arg~193#1;havoc main_~check__tmp~199#1;havoc main_~node4____CPAchecker_TMP_1~35#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8650: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9708: havoc main_~node2__m2~40#1;havoc main_~node1__m1~43#1;havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~57#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18166: havoc main_~node1____CPAchecker_TMP_1~8#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12352: havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~75#1;havoc main_~node4__m4~43#1;havoc main_~node3__m3~41#1;havoc main_~node2__m2~55#1;havoc main_~node1__m1~57#1;havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~74#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27683: havoc main_~node2____CPAchecker_TMP_0~6#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17642: havoc main_~node4____CPAchecker_TMP_0~20#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2845: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8659: havoc main_~node4__m4~32#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15003: havoc main_~node4__m4~51#1;havoc main_~node3__m3~55#1;havoc main_~node2__m2~68#1;havoc main_~node1__m1~71#1;havoc main_~main____CPAchecker_TMP_0~74#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~92#1;havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20819: havoc main_~node1____CPAchecker_TMP_0~15#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12893: havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16065: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30335: havoc main_~node1__m1~165#1;havoc main_~main____CPAchecker_TMP_0~170#1;havoc main_~__tmp_187~0#1, main_~assert__arg~186#1;havoc main_~check__tmp~192#1;havoc main_~node4__m4~113#1;havoc main_~node3__m3~108#1;havoc main_~node2__m2~125#1;havoc main_~node1__m1~164#1;havoc main_~main____CPAchecker_TMP_0~169#1;havoc main_~__tmp_186~0#1, main_~assert__arg~185#1;havoc main_~check__tmp~191#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29278: havoc main_~node1____CPAchecker_TMP_1~29#1;havoc main_~node1__m1~157#1;havoc main_~main____CPAchecker_TMP_0~162#1;havoc main_~__tmp_179~0#1, main_~assert__arg~178#1;havoc main_~check__tmp~184#1;havoc main_~node4__m4~108#1;havoc main_~node3__m3~104#1;havoc main_~node2__m2~122#1;havoc main_~node1__m1~156#1;havoc main_~main____CPAchecker_TMP_0~161#1;havoc main_~__tmp_178~0#1, main_~assert__arg~177#1;havoc main_~check__tmp~183#1; [2025-03-03 15:08:35,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8669: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-03 15:08:35,913 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11842: havoc main_~node4__m4~40#1;havoc main_~node3__m3~39#1;havoc main_~node2__m2~53#1;havoc main_~node1__m1~55#1;havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~71#1; [2025-03-03 15:08:35,913 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23472: havoc main_~node2____CPAchecker_TMP_1~6#1; [2025-03-03 15:08:35,913 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16604: havoc main_~node1__m1~79#1;havoc main_~main____CPAchecker_TMP_0~83#1;havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~101#1;havoc main_~node4__m4~58#1;havoc main_~node3__m3~61#1;havoc main_~node2__m2~74#1;havoc main_~node1__m1~78#1;havoc main_~main____CPAchecker_TMP_0~82#1;havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~100#1; [2025-03-03 15:08:35,913 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5507: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~29#1;havoc main_~node4__m4~18#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~21#1;havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~28#1; [2025-03-03 15:08:35,913 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30351: havoc main_~node1____CPAchecker_TMP_1~31#1; [2025-03-03 15:08:35,913 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27711: havoc main_~node2____CPAchecker_TMP_1~8#1; [2025-03-03 15:08:35,913 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16614: havoc main_~node1____CPAchecker_TMP_0~7#1; [2025-03-03 15:08:35,913 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13973: havoc main_~node3__m3~49#1;havoc main_~node2__m2~63#1;havoc main_~node1__m1~66#1;havoc main_~main____CPAchecker_TMP_0~67#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~85#1; [2025-03-03 15:08:35,913 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22431: havoc main_~node1__m1~111#1;havoc main_~main____CPAchecker_TMP_0~116#1;havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~137#1;havoc main_~node4__m4~85#1;havoc main_~node3__m3~83#1;havoc main_~node2__m2~97#1;havoc main_~node1__m1~110#1;havoc main_~main____CPAchecker_TMP_0~115#1;havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~136#1; [2025-03-03 15:08:35,914 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9220: havoc main_~node4__m4~33#1; [2025-03-03 15:08:35,914 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20847: havoc main_~node1____CPAchecker_TMP_1~14#1; [2025-03-03 15:08:35,914 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12921: havoc main_~node1____CPAchecker_TMP_1~3#1; [2025-03-03 15:08:35,914 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16093: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:08:35,914 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10283: havoc main_~node2__m2~44#1;havoc main_~node1__m1~47#1;havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~61#1; [2025-03-03 15:08:35,914 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22441: havoc main_~node1____CPAchecker_TMP_0~18#1; [2025-03-03 15:08:35,914 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9230: havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-03-03 15:08:35,914 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23507: havoc main_~node1____CPAchecker_TMP_1~20#1; [2025-03-03 15:08:35,914 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30379: havoc main_~node2__m2~126#1; [2025-03-03 15:08:35,914 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18754: havoc main_~node1__m1~91#1;havoc main_~main____CPAchecker_TMP_0~96#1;havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~115#1;havoc main_~node4__m4~68#1;havoc main_~node3__m3~69#1;havoc main_~node2__m2~82#1;havoc main_~node1__m1~90#1;havoc main_~main____CPAchecker_TMP_0~95#1;havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~114#1; [2025-03-03 15:08:35,914 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17168: havoc main_~main____CPAchecker_TMP_0~86#1;havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~105#1;havoc main_~node4__m4~61#1;havoc main_~node3__m3~63#1;havoc main_~node2__m2~76#1;havoc main_~node1__m1~81#1;havoc main_~main____CPAchecker_TMP_0~85#1;havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~104#1; [2025-03-03 15:08:35,914 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25099: havoc main_~node1____CPAchecker_TMP_1~23#1;havoc main_~node1__m1~127#1;havoc main_~main____CPAchecker_TMP_0~132#1;havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~154#1;havoc main_~node4__m4~94#1;havoc main_~node3__m3~91#1;havoc main_~node2__m2~108#1;havoc main_~node1__m1~126#1;havoc main_~main____CPAchecker_TMP_0~131#1;havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~153#1; [2025-03-03 15:08:35,914 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7130: havoc main_~node4__m4~25#1;havoc main_~node3__m3~28#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~28#1;havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~40#1;havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-03-03 15:08:35,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16644: havoc main_~node1____CPAchecker_TMP_1~6#1; [2025-03-03 15:08:35,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28800: havoc main_~node1__m1~154#1;havoc main_~main____CPAchecker_TMP_0~159#1;havoc main_~__tmp_176~0#1, main_~assert__arg~175#1;havoc main_~check__tmp~181#1;havoc main_~node4__m4~107#1;havoc main_~node3__m3~103#1;havoc main_~node2__m2~120#1;havoc main_~node1__m1~153#1;havoc main_~main____CPAchecker_TMP_0~158#1;havoc main_~__tmp_175~0#1, main_~assert__arg~174#1;havoc main_~check__tmp~180#1; [2025-03-03 15:08:35,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26163: havoc main_~node3__m3~95#1;havoc main_~node2__m2~112#1;havoc main_~node1__m1~135#1;havoc main_~main____CPAchecker_TMP_0~140#1;havoc main_~__tmp_157~0#1, main_~assert__arg~156#1;havoc main_~check__tmp~162#1; [2025-03-03 15:08:35,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18764: havoc main_~node1____CPAchecker_TMP_0~11#1; [2025-03-03 15:08:35,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10838: havoc main_~node2__m2~48#1;havoc main_~node1__m1~51#1;havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~65#1; [2025-03-03 15:08:35,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8196: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~47#1;havoc main_~node4__m4~30#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~33#1;havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~46#1;havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-03-03 15:08:35,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L797: havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:08:35,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13484: havoc main_~node3__m3~46#1;havoc main_~node2__m2~60#1;havoc main_~node1__m1~63#1;havoc main_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~82#1;havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-03-03 15:08:35,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22470: havoc main_~node1____CPAchecker_TMP_1~17#1; [2025-03-03 15:08:35,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16128: havoc main_~node1____CPAchecker_TMP_1~5#1; [2025-03-03 15:08:35,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6616: havoc main_~check__tmp~37#1;havoc main_~node4__m4~23#1;havoc main_~node3__m3~26#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~26#1;havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~36#1; [2025-03-03 15:08:35,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29872: havoc main_~node1__m1~161#1;havoc main_~main____CPAchecker_TMP_0~166#1;havoc main_~__tmp_183~0#1, main_~assert__arg~182#1;havoc main_~check__tmp~188#1;havoc main_~node4____CPAchecker_TMP_1~33#1; [2025-03-03 15:08:35,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28816: havoc main_~node1____CPAchecker_TMP_1~28#1; [2025-03-03 15:08:35,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8733: havoc main_~node2__m2~33#1;havoc main_~node1__m1~36#1;havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~50#1; [2025-03-03 15:08:35,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9795: havoc main_~node4__m4~34#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5039: havoc main_~node4__m4~15#1;havoc main_~node3__m3~20#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~19#1;havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~26#1;havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30937: havoc main_~node4__m4~115#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14557: havoc main_~main____CPAchecker_TMP_0~71#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~89#1;havoc main_~node4__m4~49#1;havoc main_~node3__m3~53#1;havoc main_~node2__m2~66#1;havoc main_~node1__m1~69#1;havoc main_~main____CPAchecker_TMP_0~70#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~88#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1874: havoc main_~check__tmp~7#1;havoc main_~node4__m4~6#1;havoc main_~node3__m3~5#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~5#1;havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~6#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2931: havoc main_~node3__m3~9#1;havoc main_~node2__m2~9#1;havoc main_~node1__m1~9#1;havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~14#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9805: havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L32003: havoc main_~node1__m1~177#1;havoc main_~main____CPAchecker_TMP_0~182#1;havoc main_~__tmp_199~0#1, main_~assert__arg~198#1;havoc main_~check__tmp~204#1;havoc main_~node4____CPAchecker_TMP_1~36#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30947: havoc main_~node4____CPAchecker_TMP_0~35#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27250: havoc main_~node1____CPAchecker_TMP_1~25#1;havoc main_~node1__m1~143#1;havoc main_~main____CPAchecker_TMP_0~148#1;havoc main_~__tmp_165~0#1, main_~assert__arg~164#1;havoc main_~check__tmp~170#1;havoc main_~node4__m4~101#1;havoc main_~node3__m3~99#1;havoc main_~node2__m2~115#1;havoc main_~node1__m1~142#1;havoc main_~main____CPAchecker_TMP_0~147#1;havoc main_~__tmp_164~0#1, main_~assert__arg~163#1;havoc main_~check__tmp~169#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18794: havoc main_~node1____CPAchecker_TMP_1~10#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4525: havoc main_~check__tmp~23#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~17#1;havoc main_~node1__m1~17#1;havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23552: havoc main_~node2____CPAchecker_TMP_1~7#1;havoc main_~node2__m2~103#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25668: havoc main_~node3__m3~93#1;havoc main_~node2__m2~110#1;havoc main_~node1__m1~131#1;havoc main_~main____CPAchecker_TMP_0~136#1;havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~158#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30427: havoc main_~node2____CPAchecker_TMP_0~8#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2418: havoc main_~check__tmp~11#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~7#1;havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~10#1;havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28844: havoc main_~node2__m2~121#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1363: havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~4#1;havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11405: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~69#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~37#1;havoc main_~node2__m2~51#1;havoc main_~node1__m1~53#1;havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~68#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10350: havoc main_~node4__m4~35#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9294: havoc main_~node2__m2~37#1;havoc main_~node1__m1~40#1;havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~54#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21459: havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~131#1;havoc main_~node4__m4~80#1;havoc main_~node3__m3~79#1;havoc main_~node2__m2~93#1;havoc main_~node1__m1~105#1;havoc main_~main____CPAchecker_TMP_0~110#1;havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~130#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10360: havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29389: havoc main_~node2____CPAchecker_TMP_1~10#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11951: havoc main_~node4__m4~41#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18823: havoc main_~node2__m2~83#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28337: havoc main_~node1__m1~150#1;havoc main_~main____CPAchecker_TMP_0~155#1;havoc main_~__tmp_172~0#1, main_~assert__arg~171#1;havoc main_~check__tmp~177#1;havoc main_~node4____CPAchecker_TMP_1~31#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3498: havoc main_~node3__m3~12#1;havoc main_~node2__m2~12#1;havoc main_~node1__m1~12#1;havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L31510: havoc main_~node4__m4~117#1;havoc main_~node3__m3~111#1;havoc main_~node2__m2~129#1;havoc main_~node1__m1~173#1;havoc main_~main____CPAchecker_TMP_0~178#1;havoc main_~__tmp_195~0#1, main_~assert__arg~194#1;havoc main_~check__tmp~200#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30455: havoc main_~node2____CPAchecker_TMP_1~11#1; [2025-03-03 15:08:35,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24641: havoc main_~node1__m1~124#1;havoc main_~main____CPAchecker_TMP_0~129#1;havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~151#1;havoc main_~node4__m4~93#1;havoc main_~node3__m3~90#1;havoc main_~node2__m2~107#1;havoc main_~node1__m1~123#1;havoc main_~main____CPAchecker_TMP_0~128#1;havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~150#1; [2025-03-03 15:08:35,917 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11961: havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-03-03 15:08:35,917 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30988: havoc main_~node1__m1~169#1;havoc main_~main____CPAchecker_TMP_0~174#1;havoc main_~__tmp_191~0#1, main_~assert__arg~190#1;havoc main_~check__tmp~196#1; [2025-03-03 15:08:35,917 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18833: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-03 15:08:35,917 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26765: havoc main_~node1__m1~139#1;havoc main_~main____CPAchecker_TMP_0~144#1;havoc main_~__tmp_161~0#1, main_~assert__arg~160#1;havoc main_~check__tmp~166#1;havoc main_~node4____CPAchecker_TMP_1~29#1; [2025-03-03 15:08:35,917 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19901: havoc main_~node4__m4~73#1;havoc main_~node3__m3~74#1;havoc main_~node2__m2~87#1;havoc main_~node1__m1~96#1;havoc main_~main____CPAchecker_TMP_0~101#1;havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~121#1; [2025-03-03 15:08:35,917 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29415: havoc main_~node3__m3~105#1; [2025-03-03 15:08:35,917 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23073: havoc main_~node1__m1~115#1;havoc main_~main____CPAchecker_TMP_0~120#1;havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~141#1;havoc main_~node4__m4~87#1;havoc main_~node3__m3~85#1;havoc main_~node2__m2~100#1;havoc main_~node1__m1~114#1;havoc main_~main____CPAchecker_TMP_0~119#1;havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~140#1;havoc main_~node4____CPAchecker_TMP_1~24#1; [2025-03-03 15:08:35,918 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22016: havoc main_~node4__m4~82#1;havoc main_~node3__m3~81#1;havoc main_~node2__m2~95#1;havoc main_~node1__m1~108#1;havoc main_~main____CPAchecker_TMP_0~113#1;havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~134#1;havoc main_~node4____CPAchecker_TMP_1~23#1; [2025-03-03 15:08:35,918 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17789: havoc main_~node1__m1~85#1;havoc main_~main____CPAchecker_TMP_0~90#1;havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~109#1;havoc main_~node4__m4~65#1;havoc main_~node3__m3~66#1;havoc main_~node2__m2~79#1;havoc main_~node1__m1~84#1;havoc main_~main____CPAchecker_TMP_0~89#1;havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~108#1; [2025-03-03 15:08:35,918 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10919: havoc main_~node2__m2~49#1; [2025-03-03 15:08:35,918 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26247: havoc main_~node3__m3~96#1; [2025-03-03 15:08:35,918 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28892: havoc main_~node2____CPAchecker_TMP_0~7#1; [2025-03-03 15:08:35,918 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27838: havoc main_~node4__m4~103#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-03-03 15:08:35,918 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9869: havoc main_~node2__m2~41#1;havoc main_~node1__m1~44#1;havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~58#1; [2025-03-03 15:08:35,918 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23083: havoc main_~node1____CPAchecker_TMP_0~20#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29425: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24140: havoc main_~node1__m1~120#1;havoc main_~main____CPAchecker_TMP_0~125#1;havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~147#1;havoc main_~node4____CPAchecker_TMP_1~25#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10929: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26257: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18862: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27848: havoc main_~node4____CPAchecker_TMP_0~31#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29434: havoc main_~node4__m4~109#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10939: havoc main_~node3__m3~35#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26266: havoc main_~node4__m4~97#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4071: havoc main_~node3__m3~15#1;havoc main_~node2__m2~15#1;havoc main_~node1__m1~15#1;havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1;havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25742: havoc main_~node4__m4~96#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29444: havoc main_~node4____CPAchecker_TMP_0~33#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24690: havoc main_~node1____CPAchecker_TMP_0~22#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26276: havoc main_~node4____CPAchecker_TMP_0~29#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10949: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-03 15:08:35,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28920: havoc main_~node2____CPAchecker_TMP_1~9#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13066: havoc main_~node4__m4~46#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10424: havoc main_~node2__m2~45#1;havoc main_~node1__m1~48#1;havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~62#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16767: havoc main_~node4__m4~59#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25752: havoc main_~node4____CPAchecker_TMP_0~28#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23112: havoc main_~node1____CPAchecker_TMP_1~19#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15186: havoc main_~node4__m4~52#1;havoc main_~node3__m3~56#1;havoc main_~node2__m2~69#1;havoc main_~node1__m1~72#1;havoc main_~main____CPAchecker_TMP_0~75#1;havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~93#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10958: havoc main_~node4__m4~36#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19417: havoc main_~node1__m1~94#1;havoc main_~main____CPAchecker_TMP_0~99#1;havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~119#1;havoc main_~node4__m4~71#1;havoc main_~node3__m3~72#1;havoc main_~node2__m2~85#1;havoc main_~node1__m1~93#1;havoc main_~main____CPAchecker_TMP_0~98#1;havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~118#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13076: havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20476: havoc main_~node1__m1~100#1;havoc main_~main____CPAchecker_TMP_0~105#1;havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~125#1;havoc main_~node4__m4~76#1;havoc main_~node3__m3~76#1;havoc main_~node2__m2~89#1;havoc main_~node1__m1~99#1;havoc main_~main____CPAchecker_TMP_0~104#1;havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~124#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16777: havoc main_~node4____CPAchecker_TMP_0~19#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14135: havoc main_~node3__m3~50#1;havoc main_~node2__m2~64#1;havoc main_~node1__m1~67#1;havoc main_~main____CPAchecker_TMP_0~68#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~86#1;havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17838: havoc main_~node1____CPAchecker_TMP_0~8#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10968: havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20486: havoc main_~node1____CPAchecker_TMP_0~14#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24718: havoc main_~node1____CPAchecker_TMP_1~22#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27889: havoc main_~node1__m1~147#1;havoc main_~main____CPAchecker_TMP_0~152#1;havoc main_~__tmp_169~0#1, main_~assert__arg~168#1;havoc main_~check__tmp~174#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25247: havoc main_~node4__m4~95#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L31591: havoc main_~node4__m4~118#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30007: havoc main_~node4__m4~111#1;havoc main_~node3__m3~107#1;havoc main_~node2__m2~124#1;havoc main_~node1__m1~162#1;havoc main_~main____CPAchecker_TMP_0~167#1;havoc main_~__tmp_184~0#1, main_~assert__arg~183#1;havoc main_~check__tmp~189#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23670: havoc main_~node1____CPAchecker_TMP_1~21#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25257: havoc main_~node4____CPAchecker_TMP_0~27#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29485: havoc main_~node1__m1~158#1;havoc main_~main____CPAchecker_TMP_0~163#1;havoc main_~__tmp_180~0#1, main_~assert__arg~179#1;havoc main_~check__tmp~185#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8874: havoc main_~node2__m2~34#1;havoc main_~node1__m1~37#1;havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~51#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L31601: havoc main_~node4____CPAchecker_TMP_0~36#1; [2025-03-03 15:08:35,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26317: havoc main_~node1__m1~136#1;havoc main_~main____CPAchecker_TMP_0~141#1;havoc main_~__tmp_158~0#1, main_~assert__arg~157#1;havoc main_~check__tmp~163#1; [2025-03-03 15:08:35,922 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594: havoc main_~node4__m4~11#1; [2025-03-03 15:08:35,922 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25793: havoc main_~node1__m1~132#1;havoc main_~main____CPAchecker_TMP_0~137#1;havoc main_~__tmp_154~0#1, main_~assert__arg~153#1;havoc main_~check__tmp~159#1; [2025-03-03 15:08:35,922 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17866: havoc main_~node1____CPAchecker_TMP_1~7#1; [2025-03-03 15:08:35,922 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13643: havoc main_~node3__m3~47#1;havoc main_~node2__m2~61#1;havoc main_~node1__m1~64#1;havoc main_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~83#1; [2025-03-03 15:08:35,922 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20516: havoc main_~node1____CPAchecker_TMP_1~13#1; [2025-03-03 15:08:35,922 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19988: havoc main_~node4__m4~74#1; [2025-03-03 15:08:35,922 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3604: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-03 15:08:35,923 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6251: havoc main_~node1__m1~25#1;havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~35#1;havoc main_~node4__m4~21#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~24#1;havoc main_~node1__m1~24#1;havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~34#1; [2025-03-03 15:08:35,923 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12593: havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~77#1;havoc main_~node4__m4~44#1;havoc main_~node3__m3~42#1;havoc main_~node2__m2~56#1;havoc main_~node1__m1~58#1;havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~76#1;havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-03-03 15:08:35,923 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19466: havoc main_~node1____CPAchecker_TMP_0~12#1; [2025-03-03 15:08:35,923 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23696: havoc main_~node2__m2~104#1; [2025-03-03 15:08:35,923 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19998: havoc main_~node4____CPAchecker_TMP_0~22#1; [2025-03-03 15:08:35,923 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15771: havoc main_~node1__m1~76#1;havoc main_~main____CPAchecker_TMP_0~79#1;havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~97#1;havoc main_~node4__m4~55#1;havoc main_~node3__m3~58#1;havoc main_~node2__m2~71#1;havoc main_~node1__m1~75#1;havoc main_~main____CPAchecker_TMP_0~78#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~96#1; [2025-03-03 15:08:35,923 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7848: havoc main_~node1__m1~32#1;havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~45#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~31#1;havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~44#1; [2025-03-03 15:08:35,923 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27404: havoc main_~node1__m1~144#1;havoc main_~main____CPAchecker_TMP_0~149#1;havoc main_~__tmp_166~0#1, main_~assert__arg~165#1;havoc main_~check__tmp~171#1;havoc main_~node4____CPAchecker_TMP_1~30#1; [2025-03-03 15:08:35,923 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9435: havoc main_~node2__m2~38#1;havoc main_~node1__m1~41#1;havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~55#1; [2025-03-03 15:08:35,923 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23706: havoc main_~node2____CPAchecker_TMP_0~5#1; [2025-03-03 15:08:35,923 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18423: havoc main_~node1__m1~89#1;havoc main_~main____CPAchecker_TMP_0~94#1;havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~113#1;havoc main_~node4__m4~67#1;havoc main_~node3__m3~68#1;havoc main_~node2__m2~81#1;havoc main_~node1__m1~88#1;havoc main_~main____CPAchecker_TMP_0~93#1;havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~112#1;havoc main_~node4____CPAchecker_TMP_1~20#1; [2025-03-03 15:08:35,923 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17368: havoc main_~node4__m4~62#1;havoc main_~node3__m3~64#1;havoc main_~node2__m2~77#1;havoc main_~node1__m1~82#1;havoc main_~main____CPAchecker_TMP_0~87#1;havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~106#1;havoc main_~node4____CPAchecker_TMP_1~19#1; [2025-03-03 15:08:35,923 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25298: havoc main_~node1__m1~128#1;havoc main_~main____CPAchecker_TMP_0~133#1;havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~155#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L31642: havoc main_~node1__m1~174#1;havoc main_~main____CPAchecker_TMP_0~179#1;havoc main_~__tmp_196~0#1, main_~assert__arg~195#1;havoc main_~check__tmp~201#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23716: havoc main_~node3__m3~87#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28475: havoc main_~node4__m4~105#1;havoc main_~node3__m3~102#1;havoc main_~node2__m2~119#1;havoc main_~node1__m1~151#1;havoc main_~main____CPAchecker_TMP_0~156#1;havoc main_~__tmp_173~0#1, main_~assert__arg~172#1;havoc main_~check__tmp~178#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19494: havoc main_~node1____CPAchecker_TMP_1~11#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7340: havoc main_~node4__m4~26#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~29#1;havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~41#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23726: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12100: havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~73#1;havoc main_~node4__m4~42#1;havoc main_~node3__m3~40#1;havoc main_~node2__m2~54#1;havoc main_~node1__m1~56#1;havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~72#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13157: havoc main_~node3__m3~44#1;havoc main_~node2__m2~58#1;havoc main_~node1__m1~61#1;havoc main_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~80#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5759: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~31#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~23#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~22#1;havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~30#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15273: havoc main_~node4__m4~53#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18973: havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26903: havoc main_~node4__m4~99#1;havoc main_~node3__m3~98#1;havoc main_~node2__m2~114#1;havoc main_~node1__m1~140#1;havoc main_~main____CPAchecker_TMP_0~145#1;havoc main_~__tmp_162~0#1, main_~assert__arg~161#1;havoc main_~check__tmp~167#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15806: havoc main_~node2__m2~72#1;havoc main_~node1____CPAchecker_TMP_0~6#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23735: havoc main_~node4__m4~89#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3123: havoc main_~node3__m3~10#1;havoc main_~node2__m2~10#1;havoc main_~node1__m1~10#1;havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~15#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30610: havoc main_~node1__m1~166#1;havoc main_~main____CPAchecker_TMP_0~171#1;havoc main_~__tmp_188~0#1, main_~assert__arg~187#1;havoc main_~check__tmp~193#1;havoc main_~node4____CPAchecker_TMP_1~34#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15283: havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21098: havoc main_~node1__m1~104#1;havoc main_~main____CPAchecker_TMP_0~109#1;havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~129#1;havoc main_~node4__m4~78#1;havoc main_~node3__m3~78#1;havoc main_~node2__m2~91#1;havoc main_~node1__m1~103#1;havoc main_~main____CPAchecker_TMP_0~108#1;havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~128#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6300: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23745: havoc main_~node4____CPAchecker_TMP_0~25#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5249: havoc main_~node4__m4~16#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~20#1;havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~27#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21108: havoc main_~node1____CPAchecker_TMP_0~16#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10010: havoc main_~node2__m2~42#1;havoc main_~node1__m1~45#1;havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~59#1; [2025-03-03 15:08:35,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30094: havoc main_~node4__m4~112#1; [2025-03-03 15:08:36,465 INFO L? ?]: Removed 3880 outVars from TransFormulas that were not future-live. [2025-03-03 15:08:36,465 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:08:36,526 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:08:36,526 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:08:36,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:08:36 BoogieIcfgContainer [2025-03-03 15:08:36,526 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:08:36,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:08:36,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:08:36,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:08:36,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:08:26" (1/3) ... [2025-03-03 15:08:36,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3092184a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:08:36, skipping insertion in model container [2025-03-03 15:08:36,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:28" (2/3) ... [2025-03-03 15:08:36,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3092184a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:08:36, skipping insertion in model container [2025-03-03 15:08:36,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:08:36" (3/3) ... [2025-03-03 15:08:36,533 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-03-03 15:08:36,543 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:08:36,546 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c that has 1 procedures, 3732 locations, 1 initial locations, 0 loop locations, and 17 error locations. [2025-03-03 15:08:36,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:08:36,663 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;@2a719067, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:08:36,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-03 15:08:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 3732 states, 3714 states have (on average 1.7808292945611202) internal successors, (6614), 3731 states have internal predecessors, (6614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:08:36,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:36,759 INFO L218 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] [2025-03-03 15:08:36,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:36,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash 662259618, now seen corresponding path program 1 times [2025-03-03 15:08:36,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:36,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222892248] [2025-03-03 15:08:36,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:36,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:36,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:08:37,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:08:37,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:37,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:37,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:37,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222892248] [2025-03-03 15:08:37,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222892248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:37,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:37,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:37,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294917069] [2025-03-03 15:08:37,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:37,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:37,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:37,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:37,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:37,499 INFO L87 Difference]: Start difference. First operand has 3732 states, 3714 states have (on average 1.7808292945611202) internal successors, (6614), 3731 states have internal predecessors, (6614), 0 states have call successors, (0), 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 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:40,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:40,693 INFO L93 Difference]: Finished difference Result 7023 states and 12201 transitions. [2025-03-03 15:08:40,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:40,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:08:40,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:40,723 INFO L225 Difference]: With dead ends: 7023 [2025-03-03 15:08:40,723 INFO L226 Difference]: Without dead ends: 4502 [2025-03-03 15:08:40,737 INFO L434 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 [2025-03-03 15:08:40,739 INFO L435 NwaCegarLoop]: 2976 mSDtfsCounter, 20484 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 3522 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20484 SdHoareTripleChecker+Valid, 4268 SdHoareTripleChecker+Invalid, 3659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 3522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:40,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20484 Valid, 4268 Invalid, 3659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 3522 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 15:08:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2025-03-03 15:08:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 4477. [2025-03-03 15:08:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4477 states, 4460 states have (on average 1.3017937219730942) internal successors, (5806), 4476 states have internal predecessors, (5806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 5806 transitions. [2025-03-03 15:08:40,891 INFO L78 Accepts]: Start accepts. Automaton has 4477 states and 5806 transitions. Word has length 65 [2025-03-03 15:08:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:40,892 INFO L471 AbstractCegarLoop]: Abstraction has 4477 states and 5806 transitions. [2025-03-03 15:08:40,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4477 states and 5806 transitions. [2025-03-03 15:08:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:08:40,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:40,960 INFO L218 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] [2025-03-03 15:08:40,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:08:40,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:40,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:40,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1646730721, now seen corresponding path program 1 times [2025-03-03 15:08:40,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:40,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871974926] [2025-03-03 15:08:40,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:40,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:41,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:08:41,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:08:41,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:41,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:41,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:41,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871974926] [2025-03-03 15:08:41,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871974926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:41,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:41,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:41,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061304474] [2025-03-03 15:08:41,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:41,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:41,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:41,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:41,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:41,198 INFO L87 Difference]: Start difference. First operand 4477 states and 5806 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:43,073 INFO L93 Difference]: Finished difference Result 8429 states and 10953 transitions. [2025-03-03 15:08:43,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:43,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 15:08:43,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:43,092 INFO L225 Difference]: With dead ends: 8429 [2025-03-03 15:08:43,093 INFO L226 Difference]: Without dead ends: 5662 [2025-03-03 15:08:43,098 INFO L434 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 [2025-03-03 15:08:43,099 INFO L435 NwaCegarLoop]: 1914 mSDtfsCounter, 13269 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 2316 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13269 SdHoareTripleChecker+Valid, 2583 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:43,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13269 Valid, 2583 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2316 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 15:08:43,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5662 states. [2025-03-03 15:08:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5662 to 5632. [2025-03-03 15:08:43,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5632 states, 5615 states have (on average 1.3073909171861087) internal successors, (7341), 5631 states have internal predecessors, (7341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5632 states to 5632 states and 7341 transitions. [2025-03-03 15:08:43,214 INFO L78 Accepts]: Start accepts. Automaton has 5632 states and 7341 transitions. Word has length 66 [2025-03-03 15:08:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:43,214 INFO L471 AbstractCegarLoop]: Abstraction has 5632 states and 7341 transitions. [2025-03-03 15:08:43,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5632 states and 7341 transitions. [2025-03-03 15:08:43,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:08:43,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:43,224 INFO L218 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] [2025-03-03 15:08:43,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:08:43,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:43,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1393854729, now seen corresponding path program 1 times [2025-03-03 15:08:43,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:43,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316298844] [2025-03-03 15:08:43,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:43,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:43,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:08:43,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:08:43,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:43,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:43,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:43,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316298844] [2025-03-03 15:08:43,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316298844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:43,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:43,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:43,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991972186] [2025-03-03 15:08:43,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:43,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:43,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:43,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:43,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:43,425 INFO L87 Difference]: Start difference. First operand 5632 states and 7341 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:45,160 INFO L93 Difference]: Finished difference Result 11309 states and 14761 transitions. [2025-03-03 15:08:45,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:45,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 15:08:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:45,181 INFO L225 Difference]: With dead ends: 11309 [2025-03-03 15:08:45,181 INFO L226 Difference]: Without dead ends: 7079 [2025-03-03 15:08:45,187 INFO L434 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 [2025-03-03 15:08:45,190 INFO L435 NwaCegarLoop]: 1612 mSDtfsCounter, 11557 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11557 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:45,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11557 Valid, 2246 Invalid, 2126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 15:08:45,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7079 states. [2025-03-03 15:08:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7079 to 7059. [2025-03-03 15:08:45,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7059 states, 7042 states have (on average 1.3092871343368362) internal successors, (9220), 7058 states have internal predecessors, (9220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7059 states to 7059 states and 9220 transitions. [2025-03-03 15:08:45,328 INFO L78 Accepts]: Start accepts. Automaton has 7059 states and 9220 transitions. Word has length 66 [2025-03-03 15:08:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:45,330 INFO L471 AbstractCegarLoop]: Abstraction has 7059 states and 9220 transitions. [2025-03-03 15:08:45,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:45,331 INFO L276 IsEmpty]: Start isEmpty. Operand 7059 states and 9220 transitions. [2025-03-03 15:08:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:08:45,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:45,339 INFO L218 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] [2025-03-03 15:08:45,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:08:45,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:45,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1378074495, now seen corresponding path program 1 times [2025-03-03 15:08:45,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:45,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31822747] [2025-03-03 15:08:45,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:45,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:45,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:08:45,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:08:45,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:45,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:45,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:45,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31822747] [2025-03-03 15:08:45,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31822747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:45,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:45,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:45,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657570619] [2025-03-03 15:08:45,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:45,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:45,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:45,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:45,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:45,535 INFO L87 Difference]: Start difference. First operand 7059 states and 9220 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:46,666 INFO L93 Difference]: Finished difference Result 13777 states and 18169 transitions. [2025-03-03 15:08:46,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:46,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:08:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:46,689 INFO L225 Difference]: With dead ends: 13777 [2025-03-03 15:08:46,689 INFO L226 Difference]: Without dead ends: 9203 [2025-03-03 15:08:46,696 INFO L434 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 [2025-03-03 15:08:46,696 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 9715 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9715 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:46,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9715 Valid, 2010 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:08:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9203 states. [2025-03-03 15:08:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9203 to 9163. [2025-03-03 15:08:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9163 states, 9146 states have (on average 1.323092062103652) internal successors, (12101), 9162 states have internal predecessors, (12101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:46,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9163 states to 9163 states and 12101 transitions. [2025-03-03 15:08:46,814 INFO L78 Accepts]: Start accepts. Automaton has 9163 states and 12101 transitions. Word has length 67 [2025-03-03 15:08:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:46,814 INFO L471 AbstractCegarLoop]: Abstraction has 9163 states and 12101 transitions. [2025-03-03 15:08:46,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 9163 states and 12101 transitions. [2025-03-03 15:08:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:46,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:46,820 INFO L218 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] [2025-03-03 15:08:46,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:08:46,820 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:46,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash 577361156, now seen corresponding path program 1 times [2025-03-03 15:08:46,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:46,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906687829] [2025-03-03 15:08:46,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:46,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:46,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:46,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:46,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:46,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:47,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:47,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906687829] [2025-03-03 15:08:47,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906687829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:47,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:47,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:08:47,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032576623] [2025-03-03 15:08:47,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:47,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:08:47,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:47,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:08:47,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:08:47,268 INFO L87 Difference]: Start difference. First operand 9163 states and 12101 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:49,456 INFO L93 Difference]: Finished difference Result 13732 states and 18697 transitions. [2025-03-03 15:08:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:08:49,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 15:08:49,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:49,480 INFO L225 Difference]: With dead ends: 13732 [2025-03-03 15:08:49,480 INFO L226 Difference]: Without dead ends: 12198 [2025-03-03 15:08:49,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:08:49,488 INFO L435 NwaCegarLoop]: 1456 mSDtfsCounter, 9098 mSDsluCounter, 5021 mSDsCounter, 0 mSdLazyCounter, 5198 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9098 SdHoareTripleChecker+Valid, 6477 SdHoareTripleChecker+Invalid, 5214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:49,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9098 Valid, 6477 Invalid, 5214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 5198 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 15:08:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12198 states. [2025-03-03 15:08:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12198 to 9003. [2025-03-03 15:08:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9003 states, 8986 states have (on average 1.3225016692632985) internal successors, (11884), 9002 states have internal predecessors, (11884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9003 states to 9003 states and 11884 transitions. [2025-03-03 15:08:49,641 INFO L78 Accepts]: Start accepts. Automaton has 9003 states and 11884 transitions. Word has length 68 [2025-03-03 15:08:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:49,641 INFO L471 AbstractCegarLoop]: Abstraction has 9003 states and 11884 transitions. [2025-03-03 15:08:49,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 9003 states and 11884 transitions. [2025-03-03 15:08:49,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:49,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:49,648 INFO L218 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] [2025-03-03 15:08:49,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:08:49,648 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:49,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash -509759337, now seen corresponding path program 1 times [2025-03-03 15:08:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:49,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989914720] [2025-03-03 15:08:49,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:49,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:49,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:49,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:49,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:49,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:50,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:50,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989914720] [2025-03-03 15:08:50,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989914720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:50,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:50,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:50,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330950191] [2025-03-03 15:08:50,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:50,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:50,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:50,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:50,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:50,083 INFO L87 Difference]: Start difference. First operand 9003 states and 11884 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:52,971 INFO L93 Difference]: Finished difference Result 15296 states and 20628 transitions. [2025-03-03 15:08:52,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:52,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 15:08:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:53,002 INFO L225 Difference]: With dead ends: 15296 [2025-03-03 15:08:53,002 INFO L226 Difference]: Without dead ends: 13884 [2025-03-03 15:08:53,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:53,012 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 15307 mSDsluCounter, 4914 mSDsCounter, 0 mSdLazyCounter, 6481 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15307 SdHoareTripleChecker+Valid, 6391 SdHoareTripleChecker+Invalid, 6610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 6481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:53,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15307 Valid, 6391 Invalid, 6610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 6481 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 15:08:53,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13884 states. [2025-03-03 15:08:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13884 to 8941. [2025-03-03 15:08:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8941 states, 8924 states have (on average 1.3221649484536082) internal successors, (11799), 8940 states have internal predecessors, (11799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8941 states to 8941 states and 11799 transitions. [2025-03-03 15:08:53,228 INFO L78 Accepts]: Start accepts. Automaton has 8941 states and 11799 transitions. Word has length 68 [2025-03-03 15:08:53,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:53,229 INFO L471 AbstractCegarLoop]: Abstraction has 8941 states and 11799 transitions. [2025-03-03 15:08:53,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 8941 states and 11799 transitions. [2025-03-03 15:08:53,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:53,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:53,238 INFO L218 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] [2025-03-03 15:08:53,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:08:53,238 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:53,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:53,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1267623367, now seen corresponding path program 1 times [2025-03-03 15:08:53,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:53,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320923521] [2025-03-03 15:08:53,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:53,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:53,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:53,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:53,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:53,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:54,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:54,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320923521] [2025-03-03 15:08:54,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320923521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:54,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:54,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:08:54,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35740185] [2025-03-03 15:08:54,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:54,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:08:54,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:54,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:08:54,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:54,267 INFO L87 Difference]: Start difference. First operand 8941 states and 11799 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:55,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:55,795 INFO L93 Difference]: Finished difference Result 14443 states and 19503 transitions. [2025-03-03 15:08:55,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:08:55,795 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:55,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:55,817 INFO L225 Difference]: With dead ends: 14443 [2025-03-03 15:08:55,818 INFO L226 Difference]: Without dead ends: 14439 [2025-03-03 15:08:55,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:08:55,824 INFO L435 NwaCegarLoop]: 2452 mSDtfsCounter, 18002 mSDsluCounter, 16104 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18002 SdHoareTripleChecker+Valid, 18556 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:55,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18002 Valid, 18556 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:08:55,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14439 states. [2025-03-03 15:08:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14439 to 8937. [2025-03-03 15:08:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8937 states, 8921 states have (on average 1.3221611926914023) internal successors, (11795), 8936 states have internal predecessors, (11795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8937 states to 8937 states and 11795 transitions. [2025-03-03 15:08:55,969 INFO L78 Accepts]: Start accepts. Automaton has 8937 states and 11795 transitions. Word has length 69 [2025-03-03 15:08:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:55,969 INFO L471 AbstractCegarLoop]: Abstraction has 8937 states and 11795 transitions. [2025-03-03 15:08:55,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 8937 states and 11795 transitions. [2025-03-03 15:08:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:55,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:55,974 INFO L218 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] [2025-03-03 15:08:55,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:08:55,974 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:55,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:55,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1935504399, now seen corresponding path program 1 times [2025-03-03 15:08:55,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:55,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943333351] [2025-03-03 15:08:55,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:55,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:56,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:56,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:56,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:56,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:56,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:56,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943333351] [2025-03-03 15:08:56,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943333351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:56,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:56,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:08:56,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340021310] [2025-03-03 15:08:56,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:56,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:08:56,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:56,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:08:56,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:56,529 INFO L87 Difference]: Start difference. First operand 8937 states and 11795 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:58,102 INFO L93 Difference]: Finished difference Result 14439 states and 19499 transitions. [2025-03-03 15:08:58,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:08:58,102 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:58,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:58,129 INFO L225 Difference]: With dead ends: 14439 [2025-03-03 15:08:58,129 INFO L226 Difference]: Without dead ends: 14435 [2025-03-03 15:08:58,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:08:58,135 INFO L435 NwaCegarLoop]: 2449 mSDtfsCounter, 20338 mSDsluCounter, 12783 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20338 SdHoareTripleChecker+Valid, 15232 SdHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:58,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20338 Valid, 15232 Invalid, 1903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:08:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14435 states. [2025-03-03 15:08:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14435 to 8933. [2025-03-03 15:08:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8933 states, 8918 states have (on average 1.3221574344023324) internal successors, (11791), 8932 states have internal predecessors, (11791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8933 states to 8933 states and 11791 transitions. [2025-03-03 15:08:58,263 INFO L78 Accepts]: Start accepts. Automaton has 8933 states and 11791 transitions. Word has length 69 [2025-03-03 15:08:58,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:58,263 INFO L471 AbstractCegarLoop]: Abstraction has 8933 states and 11791 transitions. [2025-03-03 15:08:58,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:58,263 INFO L276 IsEmpty]: Start isEmpty. Operand 8933 states and 11791 transitions. [2025-03-03 15:08:58,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:58,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:58,268 INFO L218 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] [2025-03-03 15:08:58,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:08:58,268 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:58,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1006203005, now seen corresponding path program 1 times [2025-03-03 15:08:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671008954] [2025-03-03 15:08:58,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:58,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:58,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:58,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:58,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:58,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:58,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671008954] [2025-03-03 15:08:58,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671008954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:58,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:58,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:58,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360882093] [2025-03-03 15:08:58,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:58,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:58,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:58,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:58,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:58,596 INFO L87 Difference]: Start difference. First operand 8933 states and 11791 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:00,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:00,733 INFO L93 Difference]: Finished difference Result 10520 states and 13936 transitions. [2025-03-03 15:09:00,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:09:00,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:09:00,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:00,749 INFO L225 Difference]: With dead ends: 10520 [2025-03-03 15:09:00,749 INFO L226 Difference]: Without dead ends: 10514 [2025-03-03 15:09:00,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:09:00,756 INFO L435 NwaCegarLoop]: 1472 mSDtfsCounter, 10074 mSDsluCounter, 4745 mSDsCounter, 0 mSdLazyCounter, 5078 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10074 SdHoareTripleChecker+Valid, 6217 SdHoareTripleChecker+Invalid, 5101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:00,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10074 Valid, 6217 Invalid, 5101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5078 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 15:09:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10514 states. [2025-03-03 15:09:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10514 to 8933. [2025-03-03 15:09:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8933 states, 8918 states have (on average 1.3220453016371383) internal successors, (11790), 8932 states have internal predecessors, (11790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8933 states to 8933 states and 11790 transitions. [2025-03-03 15:09:00,932 INFO L78 Accepts]: Start accepts. Automaton has 8933 states and 11790 transitions. Word has length 69 [2025-03-03 15:09:00,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:00,932 INFO L471 AbstractCegarLoop]: Abstraction has 8933 states and 11790 transitions. [2025-03-03 15:09:00,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:00,932 INFO L276 IsEmpty]: Start isEmpty. Operand 8933 states and 11790 transitions. [2025-03-03 15:09:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:09:00,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:00,945 INFO L218 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] [2025-03-03 15:09:00,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:09:00,945 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:00,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:00,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2141216898, now seen corresponding path program 1 times [2025-03-03 15:09:00,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:00,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366063186] [2025-03-03 15:09:00,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:00,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:01,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:09:01,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:09:01,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:01,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:01,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:01,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366063186] [2025-03-03 15:09:01,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366063186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:01,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:01,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:09:01,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803428299] [2025-03-03 15:09:01,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:01,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:09:01,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:01,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:09:01,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:01,378 INFO L87 Difference]: Start difference. First operand 8933 states and 11790 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:03,734 INFO L93 Difference]: Finished difference Result 11309 states and 14882 transitions. [2025-03-03 15:09:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:09:03,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:09:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:03,746 INFO L225 Difference]: With dead ends: 11309 [2025-03-03 15:09:03,747 INFO L226 Difference]: Without dead ends: 11300 [2025-03-03 15:09:03,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:09:03,750 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 11863 mSDsluCounter, 5847 mSDsCounter, 0 mSdLazyCounter, 6399 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11863 SdHoareTripleChecker+Valid, 7281 SdHoareTripleChecker+Invalid, 6448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 6399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:03,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11863 Valid, 7281 Invalid, 6448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 6399 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 15:09:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11300 states. [2025-03-03 15:09:03,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11300 to 8933. [2025-03-03 15:09:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8933 states, 8918 states have (on average 1.3219331688719445) internal successors, (11789), 8932 states have internal predecessors, (11789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:03,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8933 states to 8933 states and 11789 transitions. [2025-03-03 15:09:03,863 INFO L78 Accepts]: Start accepts. Automaton has 8933 states and 11789 transitions. Word has length 69 [2025-03-03 15:09:03,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:03,863 INFO L471 AbstractCegarLoop]: Abstraction has 8933 states and 11789 transitions. [2025-03-03 15:09:03,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:03,864 INFO L276 IsEmpty]: Start isEmpty. Operand 8933 states and 11789 transitions. [2025-03-03 15:09:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:09:03,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:03,868 INFO L218 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] [2025-03-03 15:09:03,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:09:03,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:03,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash 107194085, now seen corresponding path program 1 times [2025-03-03 15:09:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271446033] [2025-03-03 15:09:03,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:03,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:03,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:09:03,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:09:03,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:03,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:03,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:03,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271446033] [2025-03-03 15:09:03,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271446033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:03,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:03,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:03,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073198209] [2025-03-03 15:09:03,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:03,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:03,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:03,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:03,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:03,940 INFO L87 Difference]: Start difference. First operand 8933 states and 11789 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:04,056 INFO L93 Difference]: Finished difference Result 12981 states and 17449 transitions. [2025-03-03 15:09:04,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:04,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:09:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:04,064 INFO L225 Difference]: With dead ends: 12981 [2025-03-03 15:09:04,064 INFO L226 Difference]: Without dead ends: 8063 [2025-03-03 15:09:04,069 INFO L434 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 [2025-03-03 15:09:04,070 INFO L435 NwaCegarLoop]: 2069 mSDtfsCounter, 2034 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:04,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2034 Valid, 2792 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8063 states. [2025-03-03 15:09:04,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8063 to 8044. [2025-03-03 15:09:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8044 states, 8032 states have (on average 1.3401394422310757) internal successors, (10764), 8043 states have internal predecessors, (10764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8044 states to 8044 states and 10764 transitions. [2025-03-03 15:09:04,173 INFO L78 Accepts]: Start accepts. Automaton has 8044 states and 10764 transitions. Word has length 70 [2025-03-03 15:09:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:04,173 INFO L471 AbstractCegarLoop]: Abstraction has 8044 states and 10764 transitions. [2025-03-03 15:09:04,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 8044 states and 10764 transitions. [2025-03-03 15:09:04,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:09:04,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:04,178 INFO L218 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] [2025-03-03 15:09:04,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:09:04,178 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:04,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:04,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1597655635, now seen corresponding path program 1 times [2025-03-03 15:09:04,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:04,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799193663] [2025-03-03 15:09:04,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:04,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:04,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:09:04,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:09:04,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:04,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:04,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:04,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799193663] [2025-03-03 15:09:04,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799193663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:04,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:04,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:09:04,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005586180] [2025-03-03 15:09:04,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:04,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:09:04,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:04,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:09:04,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:09:04,699 INFO L87 Difference]: Start difference. First operand 8044 states and 10764 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:05,748 INFO L93 Difference]: Finished difference Result 11288 states and 15324 transitions. [2025-03-03 15:09:05,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:09:05,748 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:09:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:05,758 INFO L225 Difference]: With dead ends: 11288 [2025-03-03 15:09:05,758 INFO L226 Difference]: Without dead ends: 11279 [2025-03-03 15:09:05,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:09:05,760 INFO L435 NwaCegarLoop]: 1909 mSDtfsCounter, 12264 mSDsluCounter, 8665 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12264 SdHoareTripleChecker+Valid, 10574 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:05,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12264 Valid, 10574 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:09:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11279 states. [2025-03-03 15:09:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11279 to 8035. [2025-03-03 15:09:05,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8035 states, 8024 states have (on average 1.3402293120638085) internal successors, (10754), 8034 states have internal predecessors, (10754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8035 states to 8035 states and 10754 transitions. [2025-03-03 15:09:05,846 INFO L78 Accepts]: Start accepts. Automaton has 8035 states and 10754 transitions. Word has length 70 [2025-03-03 15:09:05,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:05,846 INFO L471 AbstractCegarLoop]: Abstraction has 8035 states and 10754 transitions. [2025-03-03 15:09:05,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 8035 states and 10754 transitions. [2025-03-03 15:09:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:09:05,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:05,851 INFO L218 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] [2025-03-03 15:09:05,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:09:05,851 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:05,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:05,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1337554063, now seen corresponding path program 1 times [2025-03-03 15:09:05,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:05,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673722329] [2025-03-03 15:09:05,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:05,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:05,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:09:05,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:09:05,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:05,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:06,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:06,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673722329] [2025-03-03 15:09:06,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673722329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:06,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:06,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:09:06,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337671365] [2025-03-03 15:09:06,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:06,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:09:06,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:06,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:09:06,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:09:06,365 INFO L87 Difference]: Start difference. First operand 8035 states and 10754 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:09,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:09,434 INFO L93 Difference]: Finished difference Result 22410 states and 31230 transitions. [2025-03-03 15:09:09,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 15:09:09,434 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:09:09,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:09,456 INFO L225 Difference]: With dead ends: 22410 [2025-03-03 15:09:09,457 INFO L226 Difference]: Without dead ends: 22398 [2025-03-03 15:09:09,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:09:09,464 INFO L435 NwaCegarLoop]: 1885 mSDtfsCounter, 13181 mSDsluCounter, 12970 mSDsCounter, 0 mSdLazyCounter, 4241 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13181 SdHoareTripleChecker+Valid, 14855 SdHoareTripleChecker+Invalid, 4340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 4241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:09,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13181 Valid, 14855 Invalid, 4340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 4241 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 15:09:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22398 states. [2025-03-03 15:09:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22398 to 8023. [2025-03-03 15:09:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8023 states, 8013 states have (on average 1.3405715711968051) internal successors, (10742), 8022 states have internal predecessors, (10742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8023 states to 8023 states and 10742 transitions. [2025-03-03 15:09:09,621 INFO L78 Accepts]: Start accepts. Automaton has 8023 states and 10742 transitions. Word has length 70 [2025-03-03 15:09:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:09,621 INFO L471 AbstractCegarLoop]: Abstraction has 8023 states and 10742 transitions. [2025-03-03 15:09:09,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 8023 states and 10742 transitions. [2025-03-03 15:09:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:09:09,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:09,625 INFO L218 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] [2025-03-03 15:09:09,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:09:09,625 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:09,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:09,626 INFO L85 PathProgramCache]: Analyzing trace with hash -112288515, now seen corresponding path program 1 times [2025-03-03 15:09:09,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:09,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265755711] [2025-03-03 15:09:09,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:09,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:09,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:09:09,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:09:09,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:09,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:09,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:09,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265755711] [2025-03-03 15:09:09,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265755711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:09,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:09,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:09,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362432371] [2025-03-03 15:09:09,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:09,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:09:09,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:09,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:09:09,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:09:09,830 INFO L87 Difference]: Start difference. First operand 8023 states and 10742 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:11,171 INFO L93 Difference]: Finished difference Result 12043 states and 16536 transitions. [2025-03-03 15:09:11,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:09:11,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:09:11,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:11,179 INFO L225 Difference]: With dead ends: 12043 [2025-03-03 15:09:11,179 INFO L226 Difference]: Without dead ends: 9622 [2025-03-03 15:09:11,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:09:11,182 INFO L435 NwaCegarLoop]: 1163 mSDtfsCounter, 4717 mSDsluCounter, 2688 mSDsCounter, 0 mSdLazyCounter, 3103 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4717 SdHoareTripleChecker+Valid, 3851 SdHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:11,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4717 Valid, 3851 Invalid, 3114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3103 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:09:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9622 states. [2025-03-03 15:09:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9622 to 8023. [2025-03-03 15:09:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8023 states, 8013 states have (on average 1.3404467739922625) internal successors, (10741), 8022 states have internal predecessors, (10741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8023 states to 8023 states and 10741 transitions. [2025-03-03 15:09:11,242 INFO L78 Accepts]: Start accepts. Automaton has 8023 states and 10741 transitions. Word has length 71 [2025-03-03 15:09:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:11,242 INFO L471 AbstractCegarLoop]: Abstraction has 8023 states and 10741 transitions. [2025-03-03 15:09:11,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 8023 states and 10741 transitions. [2025-03-03 15:09:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:09:11,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:11,246 INFO L218 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] [2025-03-03 15:09:11,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:09:11,246 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:11,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:11,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1968470557, now seen corresponding path program 1 times [2025-03-03 15:09:11,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:11,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218115847] [2025-03-03 15:09:11,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:11,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:11,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:09:11,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:09:11,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:11,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:11,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:11,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218115847] [2025-03-03 15:09:11,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218115847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:11,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:11,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:09:11,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136883563] [2025-03-03 15:09:11,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:11,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:09:11,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:11,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:09:11,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:11,562 INFO L87 Difference]: Start difference. First operand 8023 states and 10741 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:13,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:13,679 INFO L93 Difference]: Finished difference Result 15987 states and 22039 transitions. [2025-03-03 15:09:13,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:09:13,679 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:09:13,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:13,693 INFO L225 Difference]: With dead ends: 15987 [2025-03-03 15:09:13,694 INFO L226 Difference]: Without dead ends: 13910 [2025-03-03 15:09:13,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:09:13,701 INFO L435 NwaCegarLoop]: 1290 mSDtfsCounter, 11501 mSDsluCounter, 4255 mSDsCounter, 0 mSdLazyCounter, 5359 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11501 SdHoareTripleChecker+Valid, 5545 SdHoareTripleChecker+Invalid, 5465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 5359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:13,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11501 Valid, 5545 Invalid, 5465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 5359 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 15:09:13,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13910 states. [2025-03-03 15:09:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13910 to 8023. [2025-03-03 15:09:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8023 states, 8013 states have (on average 1.34032197678772) internal successors, (10740), 8022 states have internal predecessors, (10740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8023 states to 8023 states and 10740 transitions. [2025-03-03 15:09:13,807 INFO L78 Accepts]: Start accepts. Automaton has 8023 states and 10740 transitions. Word has length 71 [2025-03-03 15:09:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:13,807 INFO L471 AbstractCegarLoop]: Abstraction has 8023 states and 10740 transitions. [2025-03-03 15:09:13,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 8023 states and 10740 transitions. [2025-03-03 15:09:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:09:13,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:13,811 INFO L218 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] [2025-03-03 15:09:13,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:09:13,811 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:13,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:13,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1384478525, now seen corresponding path program 1 times [2025-03-03 15:09:13,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:13,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638202829] [2025-03-03 15:09:13,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:13,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:13,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:09:13,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:09:13,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:13,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:14,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:14,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638202829] [2025-03-03 15:09:14,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638202829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:14,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:14,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:09:14,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094831161] [2025-03-03 15:09:14,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:14,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:09:14,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:14,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:09:14,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:14,077 INFO L87 Difference]: Start difference. First operand 8023 states and 10740 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:15,940 INFO L93 Difference]: Finished difference Result 12472 states and 17041 transitions. [2025-03-03 15:09:15,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:09:15,941 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:09:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:15,952 INFO L225 Difference]: With dead ends: 12472 [2025-03-03 15:09:15,952 INFO L226 Difference]: Without dead ends: 10464 [2025-03-03 15:09:15,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:09:15,958 INFO L435 NwaCegarLoop]: 1176 mSDtfsCounter, 9178 mSDsluCounter, 4876 mSDsCounter, 0 mSdLazyCounter, 5110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9178 SdHoareTripleChecker+Valid, 6052 SdHoareTripleChecker+Invalid, 5153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 5110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:15,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9178 Valid, 6052 Invalid, 5153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 5110 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 15:09:15,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10464 states. [2025-03-03 15:09:16,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10464 to 8023. [2025-03-03 15:09:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8023 states, 8013 states have (on average 1.3401971795831773) internal successors, (10739), 8022 states have internal predecessors, (10739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8023 states to 8023 states and 10739 transitions. [2025-03-03 15:09:16,066 INFO L78 Accepts]: Start accepts. Automaton has 8023 states and 10739 transitions. Word has length 71 [2025-03-03 15:09:16,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:16,066 INFO L471 AbstractCegarLoop]: Abstraction has 8023 states and 10739 transitions. [2025-03-03 15:09:16,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 8023 states and 10739 transitions. [2025-03-03 15:09:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:09:16,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:16,071 INFO L218 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] [2025-03-03 15:09:16,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:09:16,071 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:16,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:16,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1259109413, now seen corresponding path program 1 times [2025-03-03 15:09:16,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:16,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354243814] [2025-03-03 15:09:16,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:16,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:16,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:09:16,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:09:16,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:16,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:16,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:16,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354243814] [2025-03-03 15:09:16,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354243814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:16,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:16,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:16,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542435321] [2025-03-03 15:09:16,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:16,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:16,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:16,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:16,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:16,134 INFO L87 Difference]: Start difference. First operand 8023 states and 10739 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:16,259 INFO L93 Difference]: Finished difference Result 12805 states and 17461 transitions. [2025-03-03 15:09:16,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:16,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:09:16,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:16,267 INFO L225 Difference]: With dead ends: 12805 [2025-03-03 15:09:16,267 INFO L226 Difference]: Without dead ends: 7709 [2025-03-03 15:09:16,272 INFO L434 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 [2025-03-03 15:09:16,273 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 1618 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:16,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 2175 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:16,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7709 states. [2025-03-03 15:09:16,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7709 to 7701. [2025-03-03 15:09:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7701 states, 7694 states have (on average 1.3608006238627501) internal successors, (10470), 7700 states have internal predecessors, (10470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7701 states to 7701 states and 10470 transitions. [2025-03-03 15:09:16,362 INFO L78 Accepts]: Start accepts. Automaton has 7701 states and 10470 transitions. Word has length 71 [2025-03-03 15:09:16,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:16,362 INFO L471 AbstractCegarLoop]: Abstraction has 7701 states and 10470 transitions. [2025-03-03 15:09:16,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 7701 states and 10470 transitions. [2025-03-03 15:09:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:09:16,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:16,366 INFO L218 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] [2025-03-03 15:09:16,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:09:16,366 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:16,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:16,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1837254652, now seen corresponding path program 1 times [2025-03-03 15:09:16,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:16,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921700909] [2025-03-03 15:09:16,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:16,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:16,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:09:16,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:09:16,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:16,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:16,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:16,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921700909] [2025-03-03 15:09:16,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921700909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:16,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:16,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:16,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917702906] [2025-03-03 15:09:16,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:16,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:16,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:16,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:16,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:16,435 INFO L87 Difference]: Start difference. First operand 7701 states and 10470 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:16,550 INFO L93 Difference]: Finished difference Result 15586 states and 21717 transitions. [2025-03-03 15:09:16,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:16,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:09:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:16,562 INFO L225 Difference]: With dead ends: 15586 [2025-03-03 15:09:16,562 INFO L226 Difference]: Without dead ends: 11048 [2025-03-03 15:09:16,568 INFO L434 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 [2025-03-03 15:09:16,568 INFO L435 NwaCegarLoop]: 1873 mSDtfsCounter, 954 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 3137 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:16,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 3137 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11048 states. [2025-03-03 15:09:16,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11048 to 11040. [2025-03-03 15:09:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11040 states, 11033 states have (on average 1.3630019033807668) internal successors, (15038), 11039 states have internal predecessors, (15038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11040 states to 11040 states and 15038 transitions. [2025-03-03 15:09:16,662 INFO L78 Accepts]: Start accepts. Automaton has 11040 states and 15038 transitions. Word has length 72 [2025-03-03 15:09:16,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:16,662 INFO L471 AbstractCegarLoop]: Abstraction has 11040 states and 15038 transitions. [2025-03-03 15:09:16,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:16,662 INFO L276 IsEmpty]: Start isEmpty. Operand 11040 states and 15038 transitions. [2025-03-03 15:09:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:09:16,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:16,666 INFO L218 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] [2025-03-03 15:09:16,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:09:16,666 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:16,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:16,666 INFO L85 PathProgramCache]: Analyzing trace with hash -493193098, now seen corresponding path program 1 times [2025-03-03 15:09:16,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:16,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713227533] [2025-03-03 15:09:16,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:16,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:16,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:09:16,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:09:16,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:16,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:16,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:16,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713227533] [2025-03-03 15:09:16,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713227533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:16,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:16,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:16,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185958156] [2025-03-03 15:09:16,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:16,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:16,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:16,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:16,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:16,736 INFO L87 Difference]: Start difference. First operand 11040 states and 15038 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:16,838 INFO L93 Difference]: Finished difference Result 24223 states and 33905 transitions. [2025-03-03 15:09:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:16,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:09:16,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:16,856 INFO L225 Difference]: With dead ends: 24223 [2025-03-03 15:09:16,856 INFO L226 Difference]: Without dead ends: 17550 [2025-03-03 15:09:16,865 INFO L434 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 [2025-03-03 15:09:16,866 INFO L435 NwaCegarLoop]: 1789 mSDtfsCounter, 1061 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 3112 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:16,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 3112 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17550 states. [2025-03-03 15:09:16,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17550 to 17542. [2025-03-03 15:09:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17542 states, 17535 states have (on average 1.372512118619903) internal successors, (24067), 17541 states have internal predecessors, (24067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17542 states to 17542 states and 24067 transitions. [2025-03-03 15:09:17,023 INFO L78 Accepts]: Start accepts. Automaton has 17542 states and 24067 transitions. Word has length 72 [2025-03-03 15:09:17,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:17,023 INFO L471 AbstractCegarLoop]: Abstraction has 17542 states and 24067 transitions. [2025-03-03 15:09:17,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 17542 states and 24067 transitions. [2025-03-03 15:09:17,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:09:17,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:17,028 INFO L218 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] [2025-03-03 15:09:17,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:09:17,028 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:17,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:17,029 INFO L85 PathProgramCache]: Analyzing trace with hash -615190020, now seen corresponding path program 1 times [2025-03-03 15:09:17,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:17,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499363744] [2025-03-03 15:09:17,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:17,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:09:17,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:09:17,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:17,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:17,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:17,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499363744] [2025-03-03 15:09:17,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499363744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:17,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:17,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:17,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081251838] [2025-03-03 15:09:17,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:17,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:17,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:17,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:17,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:17,097 INFO L87 Difference]: Start difference. First operand 17542 states and 24067 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:17,262 INFO L93 Difference]: Finished difference Result 33264 states and 47368 transitions. [2025-03-03 15:09:17,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:17,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:09:17,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:17,285 INFO L225 Difference]: With dead ends: 33264 [2025-03-03 15:09:17,286 INFO L226 Difference]: Without dead ends: 22084 [2025-03-03 15:09:17,292 INFO L434 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 [2025-03-03 15:09:17,293 INFO L435 NwaCegarLoop]: 1693 mSDtfsCounter, 1022 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:17,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 2408 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:17,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22084 states. [2025-03-03 15:09:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22084 to 17815. [2025-03-03 15:09:17,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17815 states, 17808 states have (on average 1.3936994609164421) internal successors, (24819), 17814 states have internal predecessors, (24819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17815 states to 17815 states and 24819 transitions. [2025-03-03 15:09:17,475 INFO L78 Accepts]: Start accepts. Automaton has 17815 states and 24819 transitions. Word has length 72 [2025-03-03 15:09:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:17,475 INFO L471 AbstractCegarLoop]: Abstraction has 17815 states and 24819 transitions. [2025-03-03 15:09:17,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 17815 states and 24819 transitions. [2025-03-03 15:09:17,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:09:17,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:17,479 INFO L218 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] [2025-03-03 15:09:17,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:09:17,480 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:17,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:17,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1728028075, now seen corresponding path program 1 times [2025-03-03 15:09:17,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:17,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715799863] [2025-03-03 15:09:17,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:17,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:17,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:09:17,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:09:17,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:17,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:17,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:17,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:17,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715799863] [2025-03-03 15:09:17,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715799863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:17,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:17,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:17,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549789298] [2025-03-03 15:09:17,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:17,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:17,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:17,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:17,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:17,548 INFO L87 Difference]: Start difference. First operand 17815 states and 24819 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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) [2025-03-03 15:09:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:17,741 INFO L93 Difference]: Finished difference Result 35345 states and 49947 transitions. [2025-03-03 15:09:17,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:17,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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 [2025-03-03 15:09:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:17,764 INFO L225 Difference]: With dead ends: 35345 [2025-03-03 15:09:17,764 INFO L226 Difference]: Without dead ends: 19411 [2025-03-03 15:09:17,779 INFO L434 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 [2025-03-03 15:09:17,779 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 1333 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:17,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 2184 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:17,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19411 states. [2025-03-03 15:09:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19411 to 15557. [2025-03-03 15:09:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15557 states, 15550 states have (on average 1.4118971061093248) internal successors, (21955), 15556 states have internal predecessors, (21955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15557 states to 15557 states and 21955 transitions. [2025-03-03 15:09:17,947 INFO L78 Accepts]: Start accepts. Automaton has 15557 states and 21955 transitions. Word has length 73 [2025-03-03 15:09:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:17,947 INFO L471 AbstractCegarLoop]: Abstraction has 15557 states and 21955 transitions. [2025-03-03 15:09:17,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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) [2025-03-03 15:09:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 15557 states and 21955 transitions. [2025-03-03 15:09:17,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:09:17,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:17,950 INFO L218 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] [2025-03-03 15:09:17,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:09:17,950 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:17,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:17,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1169610968, now seen corresponding path program 1 times [2025-03-03 15:09:17,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:17,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080908675] [2025-03-03 15:09:17,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:17,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:17,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:09:17,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:09:17,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:17,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:18,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080908675] [2025-03-03 15:09:18,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080908675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:18,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:18,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:18,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985806429] [2025-03-03 15:09:18,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:18,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:18,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:18,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:18,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:18,019 INFO L87 Difference]: Start difference. First operand 15557 states and 21955 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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) [2025-03-03 15:09:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:18,152 INFO L93 Difference]: Finished difference Result 31846 states and 45554 transitions. [2025-03-03 15:09:18,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:18,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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 [2025-03-03 15:09:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:18,175 INFO L225 Difference]: With dead ends: 31846 [2025-03-03 15:09:18,175 INFO L226 Difference]: Without dead ends: 17615 [2025-03-03 15:09:18,188 INFO L434 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 [2025-03-03 15:09:18,190 INFO L435 NwaCegarLoop]: 1456 mSDtfsCounter, 1360 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:18,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 1998 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17615 states. [2025-03-03 15:09:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17615 to 14136. [2025-03-03 15:09:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14136 states, 14129 states have (on average 1.4278434425649373) internal successors, (20174), 14135 states have internal predecessors, (20174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14136 states to 14136 states and 20174 transitions. [2025-03-03 15:09:18,381 INFO L78 Accepts]: Start accepts. Automaton has 14136 states and 20174 transitions. Word has length 73 [2025-03-03 15:09:18,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:18,381 INFO L471 AbstractCegarLoop]: Abstraction has 14136 states and 20174 transitions. [2025-03-03 15:09:18,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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) [2025-03-03 15:09:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 14136 states and 20174 transitions. [2025-03-03 15:09:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:09:18,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:18,383 INFO L218 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] [2025-03-03 15:09:18,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:09:18,384 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:18,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1772033699, now seen corresponding path program 1 times [2025-03-03 15:09:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:18,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951517732] [2025-03-03 15:09:18,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:18,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:18,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:09:18,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:09:18,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:18,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:18,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:18,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951517732] [2025-03-03 15:09:18,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951517732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:18,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:18,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:09:18,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304908935] [2025-03-03 15:09:18,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:18,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:09:18,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:18,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:09:18,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:18,597 INFO L87 Difference]: Start difference. First operand 14136 states and 20174 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 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) [2025-03-03 15:09:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:19,652 INFO L93 Difference]: Finished difference Result 18080 states and 25660 transitions. [2025-03-03 15:09:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:09:19,653 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 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 [2025-03-03 15:09:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:19,671 INFO L225 Difference]: With dead ends: 18080 [2025-03-03 15:09:19,671 INFO L226 Difference]: Without dead ends: 17870 [2025-03-03 15:09:19,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:09:19,678 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 7481 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 2663 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7481 SdHoareTripleChecker+Valid, 3534 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:19,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7481 Valid, 3534 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2663 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:09:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17870 states. [2025-03-03 15:09:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17870 to 14131. [2025-03-03 15:09:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14131 states, 14124 states have (on average 1.4277116964032852) internal successors, (20165), 14130 states have internal predecessors, (20165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14131 states to 14131 states and 20165 transitions. [2025-03-03 15:09:19,839 INFO L78 Accepts]: Start accepts. Automaton has 14131 states and 20165 transitions. Word has length 73 [2025-03-03 15:09:19,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:19,839 INFO L471 AbstractCegarLoop]: Abstraction has 14131 states and 20165 transitions. [2025-03-03 15:09:19,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 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) [2025-03-03 15:09:19,839 INFO L276 IsEmpty]: Start isEmpty. Operand 14131 states and 20165 transitions. [2025-03-03 15:09:19,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:09:19,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:19,843 INFO L218 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] [2025-03-03 15:09:19,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:09:19,843 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:19,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:19,843 INFO L85 PathProgramCache]: Analyzing trace with hash -361831560, now seen corresponding path program 1 times [2025-03-03 15:09:19,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:19,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076849653] [2025-03-03 15:09:19,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:19,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:19,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:09:19,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:09:19,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:19,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:20,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:20,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076849653] [2025-03-03 15:09:20,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076849653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:20,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:20,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:09:20,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606546763] [2025-03-03 15:09:20,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:20,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:09:20,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:20,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:09:20,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:20,068 INFO L87 Difference]: Start difference. First operand 14131 states and 20165 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:21,241 INFO L93 Difference]: Finished difference Result 18081 states and 25657 transitions. [2025-03-03 15:09:21,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:09:21,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:09:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:21,260 INFO L225 Difference]: With dead ends: 18081 [2025-03-03 15:09:21,260 INFO L226 Difference]: Without dead ends: 17870 [2025-03-03 15:09:21,266 INFO L434 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 [2025-03-03 15:09:21,267 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 3603 mSDsluCounter, 2682 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3603 SdHoareTripleChecker+Valid, 3513 SdHoareTripleChecker+Invalid, 2685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:21,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3603 Valid, 3513 Invalid, 2685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:09:21,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17870 states. [2025-03-03 15:09:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17870 to 14131. [2025-03-03 15:09:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14131 states, 14124 states have (on average 1.4276408949306145) internal successors, (20164), 14130 states have internal predecessors, (20164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14131 states to 14131 states and 20164 transitions. [2025-03-03 15:09:21,405 INFO L78 Accepts]: Start accepts. Automaton has 14131 states and 20164 transitions. Word has length 74 [2025-03-03 15:09:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:21,406 INFO L471 AbstractCegarLoop]: Abstraction has 14131 states and 20164 transitions. [2025-03-03 15:09:21,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 14131 states and 20164 transitions. [2025-03-03 15:09:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:09:21,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:21,408 INFO L218 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] [2025-03-03 15:09:21,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:09:21,408 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:21,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:21,408 INFO L85 PathProgramCache]: Analyzing trace with hash -305642003, now seen corresponding path program 1 times [2025-03-03 15:09:21,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:21,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055773333] [2025-03-03 15:09:21,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:21,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:21,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:09:21,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:09:21,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:21,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:21,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:21,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055773333] [2025-03-03 15:09:21,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055773333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:21,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:21,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:09:21,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823654663] [2025-03-03 15:09:21,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:21,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:09:21,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:21,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:09:21,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:09:21,772 INFO L87 Difference]: Start difference. First operand 14131 states and 20164 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:24,296 INFO L93 Difference]: Finished difference Result 51124 states and 73595 transitions. [2025-03-03 15:09:24,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 15:09:24,297 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:09:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:24,375 INFO L225 Difference]: With dead ends: 51124 [2025-03-03 15:09:24,375 INFO L226 Difference]: Without dead ends: 50891 [2025-03-03 15:09:24,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2025-03-03 15:09:24,396 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 13321 mSDsluCounter, 3727 mSDsCounter, 0 mSdLazyCounter, 3941 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13321 SdHoareTripleChecker+Valid, 4561 SdHoareTripleChecker+Invalid, 4233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 3941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:24,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13321 Valid, 4561 Invalid, 4233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 3941 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 15:09:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50891 states. [2025-03-03 15:09:24,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50891 to 14136. [2025-03-03 15:09:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14136 states, 14129 states have (on average 1.4274895604784485) internal successors, (20169), 14135 states have internal predecessors, (20169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14136 states to 14136 states and 20169 transitions. [2025-03-03 15:09:24,714 INFO L78 Accepts]: Start accepts. Automaton has 14136 states and 20169 transitions. Word has length 74 [2025-03-03 15:09:24,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:24,715 INFO L471 AbstractCegarLoop]: Abstraction has 14136 states and 20169 transitions. [2025-03-03 15:09:24,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 14136 states and 20169 transitions. [2025-03-03 15:09:24,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:09:24,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:24,717 INFO L218 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] [2025-03-03 15:09:24,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:09:24,717 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:24,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:24,717 INFO L85 PathProgramCache]: Analyzing trace with hash -528726956, now seen corresponding path program 1 times [2025-03-03 15:09:24,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:24,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447955786] [2025-03-03 15:09:24,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:24,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:24,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:09:24,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:09:24,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:24,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:25,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:25,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447955786] [2025-03-03 15:09:25,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447955786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:25,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:09:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810496380] [2025-03-03 15:09:25,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:25,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:09:25,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:25,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:09:25,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:25,011 INFO L87 Difference]: Start difference. First operand 14136 states and 20169 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:26,176 INFO L93 Difference]: Finished difference Result 18086 states and 25660 transitions. [2025-03-03 15:09:26,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:09:26,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:09:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:26,196 INFO L225 Difference]: With dead ends: 18086 [2025-03-03 15:09:26,197 INFO L226 Difference]: Without dead ends: 17875 [2025-03-03 15:09:26,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:09:26,203 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 7474 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 2646 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7474 SdHoareTripleChecker+Valid, 3534 SdHoareTripleChecker+Invalid, 2665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:26,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7474 Valid, 3534 Invalid, 2665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2646 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:09:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17875 states. [2025-03-03 15:09:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17875 to 14136. [2025-03-03 15:09:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14136 states, 14129 states have (on average 1.4274187840611507) internal successors, (20168), 14135 states have internal predecessors, (20168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14136 states to 14136 states and 20168 transitions. [2025-03-03 15:09:26,352 INFO L78 Accepts]: Start accepts. Automaton has 14136 states and 20168 transitions. Word has length 74 [2025-03-03 15:09:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:26,352 INFO L471 AbstractCegarLoop]: Abstraction has 14136 states and 20168 transitions. [2025-03-03 15:09:26,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 14136 states and 20168 transitions. [2025-03-03 15:09:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:09:26,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:26,355 INFO L218 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] [2025-03-03 15:09:26,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:09:26,355 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:26,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:26,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1083620690, now seen corresponding path program 1 times [2025-03-03 15:09:26,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:26,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912886968] [2025-03-03 15:09:26,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:26,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:26,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:09:26,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:09:26,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:26,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:26,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:26,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912886968] [2025-03-03 15:09:26,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912886968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:26,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:26,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 15:09:26,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132972943] [2025-03-03 15:09:26,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:26,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:09:26,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:26,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:09:26,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:26,650 INFO L87 Difference]: Start difference. First operand 14136 states and 20168 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:28,683 INFO L93 Difference]: Finished difference Result 33117 states and 47180 transitions. [2025-03-03 15:09:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:09:28,684 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:09:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:28,725 INFO L225 Difference]: With dead ends: 33117 [2025-03-03 15:09:28,726 INFO L226 Difference]: Without dead ends: 32827 [2025-03-03 15:09:28,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:09:28,739 INFO L435 NwaCegarLoop]: 1033 mSDtfsCounter, 5781 mSDsluCounter, 4982 mSDsCounter, 0 mSdLazyCounter, 5024 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5781 SdHoareTripleChecker+Valid, 6015 SdHoareTripleChecker+Invalid, 5092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 5024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:28,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5781 Valid, 6015 Invalid, 5092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 5024 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 15:09:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32827 states. [2025-03-03 15:09:28,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32827 to 14136. [2025-03-03 15:09:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14136 states, 14129 states have (on average 1.4273480076438532) internal successors, (20167), 14135 states have internal predecessors, (20167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14136 states to 14136 states and 20167 transitions. [2025-03-03 15:09:28,983 INFO L78 Accepts]: Start accepts. Automaton has 14136 states and 20167 transitions. Word has length 74 [2025-03-03 15:09:28,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:28,983 INFO L471 AbstractCegarLoop]: Abstraction has 14136 states and 20167 transitions. [2025-03-03 15:09:28,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:28,983 INFO L276 IsEmpty]: Start isEmpty. Operand 14136 states and 20167 transitions. [2025-03-03 15:09:28,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:09:28,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:28,986 INFO L218 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] [2025-03-03 15:09:28,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:09:28,986 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:28,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1916766730, now seen corresponding path program 1 times [2025-03-03 15:09:28,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:28,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230640997] [2025-03-03 15:09:28,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:28,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:29,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:09:29,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:09:29,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:29,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:29,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:29,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230640997] [2025-03-03 15:09:29,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230640997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:29,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:29,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:09:29,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495737053] [2025-03-03 15:09:29,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:29,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:09:29,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:29,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:09:29,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:29,226 INFO L87 Difference]: Start difference. First operand 14136 states and 20167 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:30,462 INFO L93 Difference]: Finished difference Result 21009 states and 29918 transitions. [2025-03-03 15:09:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:09:30,463 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:09:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:30,487 INFO L225 Difference]: With dead ends: 21009 [2025-03-03 15:09:30,487 INFO L226 Difference]: Without dead ends: 20776 [2025-03-03 15:09:30,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:09:30,495 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 6161 mSDsluCounter, 3456 mSDsCounter, 0 mSdLazyCounter, 3323 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6161 SdHoareTripleChecker+Valid, 4323 SdHoareTripleChecker+Invalid, 3343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:30,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6161 Valid, 4323 Invalid, 3343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3323 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:09:30,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20776 states. [2025-03-03 15:09:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20776 to 14136. [2025-03-03 15:09:30,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14136 states, 14129 states have (on average 1.4272772312265554) internal successors, (20166), 14135 states have internal predecessors, (20166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14136 states to 14136 states and 20166 transitions. [2025-03-03 15:09:30,653 INFO L78 Accepts]: Start accepts. Automaton has 14136 states and 20166 transitions. Word has length 74 [2025-03-03 15:09:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:30,653 INFO L471 AbstractCegarLoop]: Abstraction has 14136 states and 20166 transitions. [2025-03-03 15:09:30,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 14136 states and 20166 transitions. [2025-03-03 15:09:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:09:30,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:30,655 INFO L218 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] [2025-03-03 15:09:30,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:09:30,655 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:30,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash -273214030, now seen corresponding path program 1 times [2025-03-03 15:09:30,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:30,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533163790] [2025-03-03 15:09:30,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:30,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:09:30,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:09:30,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:30,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:30,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:30,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533163790] [2025-03-03 15:09:30,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533163790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:30,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:30,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:09:30,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953260038] [2025-03-03 15:09:30,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:30,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:09:30,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:30,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:09:30,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:30,888 INFO L87 Difference]: Start difference. First operand 14136 states and 20166 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:31,970 INFO L93 Difference]: Finished difference Result 18086 states and 25657 transitions. [2025-03-03 15:09:31,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:09:31,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:09:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:31,991 INFO L225 Difference]: With dead ends: 18086 [2025-03-03 15:09:31,991 INFO L226 Difference]: Without dead ends: 17875 [2025-03-03 15:09:31,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:09:31,998 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 7395 mSDsluCounter, 2743 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7395 SdHoareTripleChecker+Valid, 3593 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:31,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7395 Valid, 3593 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:09:32,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17875 states. [2025-03-03 15:09:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17875 to 14136. [2025-03-03 15:09:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14136 states, 14129 states have (on average 1.4272064548092576) internal successors, (20165), 14135 states have internal predecessors, (20165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14136 states to 14136 states and 20165 transitions. [2025-03-03 15:09:32,160 INFO L78 Accepts]: Start accepts. Automaton has 14136 states and 20165 transitions. Word has length 74 [2025-03-03 15:09:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:32,161 INFO L471 AbstractCegarLoop]: Abstraction has 14136 states and 20165 transitions. [2025-03-03 15:09:32,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 14136 states and 20165 transitions. [2025-03-03 15:09:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:09:32,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:32,163 INFO L218 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] [2025-03-03 15:09:32,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:09:32,163 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:32,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:32,163 INFO L85 PathProgramCache]: Analyzing trace with hash -492868097, now seen corresponding path program 1 times [2025-03-03 15:09:32,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:32,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739763870] [2025-03-03 15:09:32,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:32,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:32,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:09:32,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:09:32,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:32,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:32,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:32,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739763870] [2025-03-03 15:09:32,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739763870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:32,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:32,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:32,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708977401] [2025-03-03 15:09:32,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:32,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:32,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:32,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:32,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:32,229 INFO L87 Difference]: Start difference. First operand 14136 states and 20165 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) [2025-03-03 15:09:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:32,339 INFO L93 Difference]: Finished difference Result 32802 states and 47498 transitions. [2025-03-03 15:09:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:32,339 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 [2025-03-03 15:09:32,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:32,363 INFO L225 Difference]: With dead ends: 32802 [2025-03-03 15:09:32,363 INFO L226 Difference]: Without dead ends: 20477 [2025-03-03 15:09:32,376 INFO L434 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 [2025-03-03 15:09:32,377 INFO L435 NwaCegarLoop]: 1458 mSDtfsCounter, 903 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:32,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 2044 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:32,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20477 states. [2025-03-03 15:09:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20477 to 16463. [2025-03-03 15:09:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16463 states, 16456 states have (on average 1.4215483714146815) internal successors, (23393), 16462 states have internal predecessors, (23393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16463 states to 16463 states and 23393 transitions. [2025-03-03 15:09:32,560 INFO L78 Accepts]: Start accepts. Automaton has 16463 states and 23393 transitions. Word has length 75 [2025-03-03 15:09:32,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:32,560 INFO L471 AbstractCegarLoop]: Abstraction has 16463 states and 23393 transitions. [2025-03-03 15:09:32,560 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) [2025-03-03 15:09:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand 16463 states and 23393 transitions. [2025-03-03 15:09:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:09:32,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:32,562 INFO L218 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] [2025-03-03 15:09:32,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:09:32,562 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:32,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:32,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1235546662, now seen corresponding path program 1 times [2025-03-03 15:09:32,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:32,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598284780] [2025-03-03 15:09:32,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:32,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:32,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:09:32,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:09:32,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:32,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:32,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:32,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598284780] [2025-03-03 15:09:32,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598284780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:32,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:32,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:09:32,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111457863] [2025-03-03 15:09:32,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:32,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:09:32,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:32,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:09:32,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:32,766 INFO L87 Difference]: Start difference. First operand 16463 states and 23393 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 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) [2025-03-03 15:09:33,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:33,893 INFO L93 Difference]: Finished difference Result 21052 states and 29687 transitions. [2025-03-03 15:09:33,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:09:33,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 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 [2025-03-03 15:09:33,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:33,918 INFO L225 Difference]: With dead ends: 21052 [2025-03-03 15:09:33,918 INFO L226 Difference]: Without dead ends: 20969 [2025-03-03 15:09:33,925 INFO L434 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 [2025-03-03 15:09:33,925 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 5116 mSDsluCounter, 2810 mSDsCounter, 0 mSdLazyCounter, 2907 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5116 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 2928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:33,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5116 Valid, 3684 Invalid, 2928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2907 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:09:33,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20969 states. [2025-03-03 15:09:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20969 to 16458. [2025-03-03 15:09:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16458 states, 16451 states have (on average 1.4216157072518387) internal successors, (23387), 16457 states have internal predecessors, (23387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16458 states to 16458 states and 23387 transitions. [2025-03-03 15:09:34,109 INFO L78 Accepts]: Start accepts. Automaton has 16458 states and 23387 transitions. Word has length 75 [2025-03-03 15:09:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:34,110 INFO L471 AbstractCegarLoop]: Abstraction has 16458 states and 23387 transitions. [2025-03-03 15:09:34,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 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) [2025-03-03 15:09:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 16458 states and 23387 transitions. [2025-03-03 15:09:34,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:09:34,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:34,112 INFO L218 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] [2025-03-03 15:09:34,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:09:34,112 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:34,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:34,112 INFO L85 PathProgramCache]: Analyzing trace with hash 114512813, now seen corresponding path program 1 times [2025-03-03 15:09:34,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:34,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103470729] [2025-03-03 15:09:34,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:34,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:34,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:09:34,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:09:34,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:34,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:34,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:34,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103470729] [2025-03-03 15:09:34,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103470729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:34,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:34,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 15:09:34,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036497316] [2025-03-03 15:09:34,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:34,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 15:09:34,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:34,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 15:09:34,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-03 15:09:34,749 INFO L87 Difference]: Start difference. First operand 16458 states and 23387 transitions. Second operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 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) [2025-03-03 15:09:36,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:36,399 INFO L93 Difference]: Finished difference Result 29849 states and 42420 transitions. [2025-03-03 15:09:36,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:09:36,399 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 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 [2025-03-03 15:09:36,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:36,436 INFO L225 Difference]: With dead ends: 29849 [2025-03-03 15:09:36,436 INFO L226 Difference]: Without dead ends: 29781 [2025-03-03 15:09:36,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2025-03-03 15:09:36,448 INFO L435 NwaCegarLoop]: 1453 mSDtfsCounter, 8387 mSDsluCounter, 12063 mSDsCounter, 0 mSdLazyCounter, 2633 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8387 SdHoareTripleChecker+Valid, 13516 SdHoareTripleChecker+Invalid, 2658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:36,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8387 Valid, 13516 Invalid, 2658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2633 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:09:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29781 states. [2025-03-03 15:09:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29781 to 16458. [2025-03-03 15:09:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16458 states, 16451 states have (on average 1.4214941340951919) internal successors, (23385), 16457 states have internal predecessors, (23385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16458 states to 16458 states and 23385 transitions. [2025-03-03 15:09:36,666 INFO L78 Accepts]: Start accepts. Automaton has 16458 states and 23385 transitions. Word has length 77 [2025-03-03 15:09:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:36,666 INFO L471 AbstractCegarLoop]: Abstraction has 16458 states and 23385 transitions. [2025-03-03 15:09:36,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 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) [2025-03-03 15:09:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 16458 states and 23385 transitions. [2025-03-03 15:09:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:09:36,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:36,668 INFO L218 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] [2025-03-03 15:09:36,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:09:36,668 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:36,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash 839381459, now seen corresponding path program 1 times [2025-03-03 15:09:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:36,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534174946] [2025-03-03 15:09:36,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:36,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:36,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:09:36,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:09:36,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:36,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:37,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:37,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534174946] [2025-03-03 15:09:37,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534174946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:37,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:37,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:09:37,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426399362] [2025-03-03 15:09:37,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:37,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:09:37,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:37,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:09:37,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:09:37,051 INFO L87 Difference]: Start difference. First operand 16458 states and 23385 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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) [2025-03-03 15:09:38,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:38,553 INFO L93 Difference]: Finished difference Result 57791 states and 82103 transitions. [2025-03-03 15:09:38,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 15:09:38,554 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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 [2025-03-03 15:09:38,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:38,632 INFO L225 Difference]: With dead ends: 57791 [2025-03-03 15:09:38,633 INFO L226 Difference]: Without dead ends: 57694 [2025-03-03 15:09:38,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:09:38,654 INFO L435 NwaCegarLoop]: 1701 mSDtfsCounter, 11295 mSDsluCounter, 8233 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11295 SdHoareTripleChecker+Valid, 9934 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:38,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11295 Valid, 9934 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:09:38,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57694 states. [2025-03-03 15:09:38,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57694 to 16427. [2025-03-03 15:09:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16427 states, 16421 states have (on average 1.421716095243895) internal successors, (23346), 16426 states have internal predecessors, (23346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16427 states to 16427 states and 23346 transitions. [2025-03-03 15:09:39,006 INFO L78 Accepts]: Start accepts. Automaton has 16427 states and 23346 transitions. Word has length 77 [2025-03-03 15:09:39,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:39,006 INFO L471 AbstractCegarLoop]: Abstraction has 16427 states and 23346 transitions. [2025-03-03 15:09:39,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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) [2025-03-03 15:09:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 16427 states and 23346 transitions. [2025-03-03 15:09:39,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:09:39,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:39,008 INFO L218 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] [2025-03-03 15:09:39,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:09:39,008 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:09:39,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash 261550884, now seen corresponding path program 1 times [2025-03-03 15:09:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:39,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723650151] [2025-03-03 15:09:39,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:39,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:39,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:09:39,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:09:39,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:39,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:40,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:40,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723650151] [2025-03-03 15:09:40,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723650151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:40,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:40,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-03 15:09:40,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483925202] [2025-03-03 15:09:40,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:40,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 15:09:40,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:40,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 15:09:40,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:09:40,043 INFO L87 Difference]: Start difference. First operand 16427 states and 23346 transitions. Second operand has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 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)